Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 63
Página 63
... search methods armed with whatever direct techniques are available to guide the search . In this chapter , a framework for describing search methods is ... Best-First Search Problem Reduction Constraint Satisfaction Means-Ends Analysis.
... search methods armed with whatever direct techniques are available to guide the search . In this chapter , a framework for describing search methods is ... Best-First Search Problem Reduction Constraint Satisfaction Means-Ends Analysis.
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 - ...
Página 98
... search space ( s ) represent . Sometimes the states represent complete potential solutions ( as in hill climbing ) ... best - first search be worse than simple breadth - first search ? 2. Suppose we have a problem that we intend to solve ...
... search space ( s ) represent . Sometimes the states represent complete potential solutions ( as in hill climbing ) ... best - first search be worse than simple breadth - first search ? 2. Suppose we have a problem that we intend to solve ...
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