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 24
Página 39
... First Search Tree Algorithm : Depth - First Search 1. If the initial state is a goal state , quit and return success ... breadth - first search , where all of the tree that has so far been generated must be stored . • By chance ( or if ...
... First Search Tree Algorithm : Depth - First Search 1. If the initial state is a goal state , quit and return success ... breadth - first search , where all of the tree that has so far been generated must be stored . • By chance ( or if ...
Página 62
... search , we must define an appropriate state space . For each of the problems mentioned above for which it was not ... breadth - first search would work better than depth - first search . Give an example of a problem for which depth ...
... search , we must define an appropriate state space . For each of the problems mentioned above for which it was not ... breadth - first search would work better than depth - first search . Give an example of a problem for which depth ...
Página 73
Elaine Rich, Kevin Knight. 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 ...
Elaine Rich, Kevin Knight. 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 ...
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