Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 86
Página 77
Check to see if the new path or the old path is better just as in step 2 ( c ) , and set
the parent link and g and f ' values appropriately . If we have just found a better
path to OLD , we must propagate the improvement to OLD ' s successors . This is
...
Check to see if the new path or the old path is better just as in step 2 ( c ) , and set
the parent link and g and f ' values appropriately . If we have just found a better
path to OLD , we must propagate the improvement to OLD ' s successors . This is
...
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
What Is Artificial Intelligence? | 3 |
Problems Problem Spaces and Search | 29 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 21 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important 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 predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights