Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 88
Página 63
... methods armed with whatever direct techniques are available to guide the search . In this chapter , a framework for describing search methods is provided and several general - purpose search techniques are discussed . These methods are ...
... methods armed with whatever direct techniques are available to guide the search . In this chapter , a framework for describing search methods is provided and several general - purpose search techniques are discussed . These methods are ...
Página 68
... methods , such as the nearest neighbor heuristic described in Section 2.2.2 , the advantage of being less combinatorially explosive than comparable global methods . But it also shares with other local methods a lack of a guarantee that ...
... methods , such as the nearest neighbor heuristic described in Section 2.2.2 , the advantage of being less combinatorially explosive than comparable global methods . But it also shares with other local methods a lack of a guarantee that ...
Página 330
... methods for doing these two kinds of decomposition have been proposed and we investigate them in this chapter . These methods focus on ways of decomposing the original problem into appropriate subparts and on ways of recording and ...
... methods for doing these two kinds of decomposition have been proposed and we investigate them in this chapter . These methods focus on ways of decomposing the original problem into appropriate subparts and on ways of recording and ...
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