Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 26
Página 39
... First Search Tree Algorithm : Depth - First Search 1. If the initial state is a goal state , quit and return success ... breadth - first search , where all of the tree that has so far been generated must be stored . • By chance ( or if ...
... First Search Tree Algorithm : Depth - First Search 1. If the initial state is a goal state , quit and return success ... breadth - first search , where all of the tree that has so far been generated must be stored . • By chance ( or if ...
Página 62
... search , we must define an appropriate state space . For each of the problems mentioned above for which it was not ... breadth - first search would work better than depth - first search . Give an example of a problem for which depth ...
... search , we must define an appropriate state space . For each of the problems mentioned above for which it was not ... breadth - first search would work better than depth - first search . Give an example of a problem for which depth ...
Página 73
Elaine Rich. 3.3 Best - First Search Until now , we have really only discussed two systematic control strategies , breadth - first search and depth - first search ( of several varieties ) . In this section , we discuss a new method , best - ...
Elaine Rich. 3.3 Best - First Search Until now , we have really only discussed two systematic control strategies , breadth - first search and depth - first search ( of several varieties ) . In this section , we discuss a new method , best - ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's