Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 92
Página 75
CLOSED — nodes that have already been examined . We need to keep these
nodes in memory if we want to search a graph rather than a tree , since whenever
a new node is generated , we need to check whether it has been generated ...
CLOSED — nodes that have already been examined . We need to keep these
nodes in memory if we want to search a graph rather than a tree , since whenever
a new node is generated , we need to check whether it has been generated ...
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 87
Let GRAPH consist only of the node representing the initial state . ... than
FUTILITY , repeat the following procedure : ( a ) Trace the labeled arcs from INIT
and select for expansion one of the as yet unexpanded nodes that occurs on this
path .
Let GRAPH consist only of the node representing the initial state . ... than
FUTILITY , repeat the following procedure : ( a ) Trace the labeled arcs from INIT
and select for expansion one of the as yet unexpanded nodes that occurs on this
path .
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
Contenido
Problems Problem Spaces and Search | 29 |
7 | 61 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 11 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 choose 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