Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 83
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 are by no means guaranteed : • Backtrack to some earlier node and try going in a different direction . This ... methods , such as the nearest neighbor heuristic described in Section 2.2.2 , the advantage of being less ...
... methods are by no means guaranteed : • Backtrack to some earlier node and try going in a different direction . This ... methods , such as the nearest neighbor heuristic described in Section 2.2.2 , the advantage of being less ...
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
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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