Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 85
Página 75
... nodes in memory if we want to search a graph rather than a tree , since whenever a new node is generated , we need to check whether it has been generated before . We will also need a heuristic function that estimates the merits of each node ...
... nodes in memory if we want to search a graph rather than a tree , since whenever a new node is generated , we need to check whether it has been generated before . We will also need a heuristic function that estimates the merits of each node ...
Página 84
... node and following the current best path , and accumulate the set of nodes that are on that path and have not yet ... node . Otherwise , add its successors to the graph and for each of them compute f ' ( use only h ' and ignore g , for ...
... node and following the current best path , and accumulate the set of nodes that are on that path and have not yet ... node . Otherwise , add its successors to the graph and for each of them compute f ' ( use only h ' and ignore g , for ...
Página 87
... nodes that occurs on this path . Call the selected node NODE . ( b ) Generate the successors of NODE . If there are none , then assign FUTILITY as the h ' value of NODE . This is equivalent to saying that NODE is not solvable . If there ...
... nodes that occurs on this path . Call the selected node NODE . ( b ) Generate the successors of NODE . If there are none , then assign FUTILITY as the h ' value of NODE . This is equivalent to saying that NODE is not solvable . If there ...
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