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 85
Página 76
... already have . The basic idea of this algorithm is simple . Unfortunately , it is rarely the case that graph traversal algorithms are simple to write correctly . And it is even rarer that it is simple to guarantee the correctness of ...
... already have . The basic idea of this algorithm is simple . Unfortunately , it is rarely the case that graph traversal algorithms are simple to write correctly . And it is even rarer that it is simple to guarantee the correctness of ...
Página 77
... already been found.4 This condition is easy to check for . Each node's parent link points back to its best known parent . As we propagate down to a node , see if its parent points to the node we are coming from . If so , continue the ...
... already been found.4 This condition is easy to check for . Each node's parent link points back to its best known parent . As we propagate down to a node , see if its parent points to the node we are coming from . If so , continue the ...
Página 80
... already know . " AM's goal was to generate new “ interesting " mathematical concepts . It succeeded in discovering ... already on the agenda . If so , then see if this same reason for doing it is already on its list of justifications ...
... already know . " AM's goal was to generate new “ interesting " mathematical concepts . It succeeded in discovering ... already on the agenda . If so , then see if this same reason for doing it is already on its list of justifications ...
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