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 30
Página 320
... effect , in which an inevitable bad event can be delayed by various tactics until it does not appear in the portion of the game tree that minimax explores . The horizon effect can also influence a program's perception of good moves . The ...
... effect , in which an inevitable bad event can be delayed by various tactics until it does not appear in the portion of the game tree that minimax explores . The horizon effect can also influence a program's perception of good moves . The ...
Página 384
... effect is different . We can discover this intended effect by applying a set of rules that characterize cooperative dialogues . In this example , we use the fact that when the user claims to want something that the system is capable of ...
... effect is different . We can discover this intended effect by applying a set of rules that characterize cooperative dialogues . In this example , we use the fact that when the user claims to want something that the system is capable of ...
Página 616
... effect 522 INTERNIST 240 interpretations 199 intersection search 252 IPP 543 isa hierarchies 111 , 115 , 126 , 137 , 251 , 258 , 265 , 268 , 269 , 270 , 271 , 274 , 462 , 485 iterative deepening 322 Iterative - Deepening - A * algorithm ...
... effect 522 INTERNIST 240 interpretations 199 intersection search 252 IPP 543 isa hierarchies 111 , 115 , 126 , 137 , 251 , 258 , 265 , 268 , 269 , 270 , 271 , 274 , 462 , 485 iterative deepening 322 Iterative - Deepening - A * algorithm ...
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