Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 12
... look at several parts of the board at once , whereas the conventional computer must look at the squares one at a time . Sometimes an investigation of how people solve problems sheds great light on how computers should do so . At other ...
... look at several parts of the board at once , whereas the conventional computer must look at the squares one at a time . Sometimes an investigation of how people solve problems sheds great light on how computers should do so . At other ...
Página 73
... looks more promising , so it is pursued , generating nodes G and H. But again when these new nodes are evaluated they look less promising than another path , so attention is returned to the path through D to E. E is then expanded ...
... looks more promising , so it is pursued , generating nodes G and H. But again when these new nodes are evaluated they look less promising than another path , so attention is returned to the path through D to E. E is then expanded ...
Página 339
... look for another one , and hope that it is better . Although this is simple , it may lead to a great deal of wasted effort . A slightly better approach is to look at the situation that results when the sequence of operations ...
... look for another one , and hope that it is better . Although this is simple , it may lead to a great deal of wasted effort . A slightly better approach is to look at the situation that results when the sequence of operations ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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