Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 79
Página 329
... becomes important to be able to work on small pieces of a problem separately and then to combine the partial solutions at the end into a complete problem solution . Unless we can do this , the number of combinations of the states of the ...
... becomes important to be able to work on small pieces of a problem separately and then to combine the partial solutions at the end into a complete problem solution . Unless we can do this , the number of combinations of the states of the ...
Página 400
... becomes unmanageable . In addition , each new entry into the lexicon may require that a new marker be added to each of the existing entries . The breakdown of the semantic marker approach when the number of words and word senses becomes ...
... becomes unmanageable . In addition , each new entry into the lexicon may require that a new marker be added to each of the existing entries . The breakdown of the semantic marker approach when the number of words and word senses becomes ...
Página 528
... becomes living only if it is surrounded by exactly three living cells . Otherwise , it remains dead . For example : 0 O → cell becomes dead → cell stays dead O O → cell stays living 0 → cell becomes living ( a ) Create input ...
... becomes living only if it is surrounded by exactly three living cells . Otherwise , it remains dead . For example : 0 O → cell becomes dead → cell stays dead O O → cell stays living 0 → cell becomes living ( a ) Create input ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space