Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 67
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 provided and several general - purpose search ... Best-First Search Problem Reduction.
... search 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 ... Best-First Search Problem Reduction.
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
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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