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 82
Página 76
... algorithm is simple . Unfortunately , it is rarely the case that graph traversal algorithms are simple to write ... algorithm in more detail as an example of the design and analysis of a graph - search program . 3.3.2 The A * Algorithm ...
... algorithm is simple . Unfortunately , it is rarely the case that graph traversal algorithms are simple to write ... algorithm in more detail as an example of the design and analysis of a graph - search program . 3.3.2 The A * Algorithm ...
Página 86
... Algorithm The problem reduction algorithm we just described is a simplification of an algorithm described in Martelli and Montanari [ 1973 ] , Martelli and Montanari [ 1978 ] , and Nilsson [ 1980 ] . Nilsson calls it the AO * algorithm ...
... Algorithm The problem reduction algorithm we just described is a simplification of an algorithm described in Martelli and Montanari [ 1973 ] , Martelli and Montanari [ 1978 ] , and Nilsson [ 1980 ] . Nilsson calls it the AO * algorithm ...
Página 271
... algorithm for inheritance . But that algorithm assumed that the isa hierarchy was a tree . This is often not the case . To support flexible representations of knowledge about the world , it is necessary to allow the hierarchy to be an ...
... algorithm for inheritance . But that algorithm assumed that the isa hierarchy was a tree . This is often not the case . To support flexible representations of knowledge about the world , it is necessary to allow the hierarchy to be an ...
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