Artificial IntelligenceThe breadth of A. I. is explored and explained in this best selling text. Assuming no prior knowledge,it covers topics like neural networks and robotics. This text explores the range of problems which have been and remain to be solved using A. I. tools and techniques. The second half of this text is an excellent reference. |
Dentro del libro
Resultados 1-3 de 87
Página 77
via BESTNODE by comparing their g values . If OLD is cheaper ( or just as cheap
) , then we need do nothing . If SUCCESSOR is cheaper , then reset OLD ' s
parent link to point to BESTNODE , record the new cheaper path in g ( OLD ) ,
and ...
via BESTNODE by comparing their g values . If OLD is cheaper ( or just as cheap
) , then we need do nothing . If SUCCESSOR is cheaper , then reset OLD ' s
parent link to point to BESTNODE , record the new cheaper path in g ( OLD ) ,
and ...
Página 84
Loop until the starting node is labeled SOLVED or until its cost goes above
FUTILITY : ( a ) Traverse the graph , starting at the initial node and following the
current best path , and accumulate the set of nodes that are on that path and
have not ...
Loop until the starting node is labeled SOLVED or until its cost goes above
FUTILITY : ( a ) Traverse the graph , starting at the initial node and following the
current best path , and accumulate the set of nodes that are on that path and
have not ...
Página 318
The best known path is now from CURRENT to SUCC and then on to the
appropriate path from SUCC as determined by the recursive call to MINIMAX - A -
B . So set BEST - PATH to the result of attaching SUCC to the front of PATH (
RESULT ...
The best known path is now from CURRENT to SUCC and then on to the
appropriate path from SUCC as determined by the recursive call to MINIMAX - A -
B . So set BEST - PATH to the result of attaching SUCC to the front of PATH (
RESULT ...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
8 | 231 |
Expert Systems | 233 |
Weak SlotandFiller Structures | 251 |
Derechos de autor | |
Otras 16 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
actions active addition agents algorithm allow answer applied approach attributes becomes belief block build called Chapter choose combined complete concept consider constraints contains corresponding define dependency described discussed domain efficient elements example fact Figure frame function given goal heuristic important inheritance initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible preconditions predicate problem procedure produce properties question reasoning relation represent representation result rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific step stored structure Suppose task techniques things tree true understanding units weights
Información bibliográfica
| Título | Artificial Intelligence Artificial Intelligence Series Mac Graw-Hill series in artificial inteligence |
| Autores | Elaine Rich, Kevin Knight, Knight Kevin |
| Edición | 2, ilustrada |
| Editor | McGraw-Hill, 1991 |
| ISBN | 0070522634, 9780070522633 |
| Largo | 621 páginas |
| Exportar cita | BiBTeX EndNote RefMan |