Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 69
Página 329
For example , the A * algorithm provides a way of conducting a best - first search
through a graph representing a problem space . Each node that is examined in
the A * algorithm represents a description of a complete problem state , and each
...
For example , the A * algorithm provides a way of conducting a best - first search
through a graph representing a problem space . Each node that is examined in
the A * algorithm represents a description of a complete problem state , and each
...
Página 347
A plan generated by this method contains a sequence of operators for attaining
the first goal , followed by a complete sequence for the second goal , etc . But as
we have seen , difficult problems cause goal interactions . The operators used to
...
A plan generated by this method contains a sequence of operators for attaining
the first goal , followed by a complete sequence for the second goal , etc . But as
we have seen , difficult problems cause goal interactions . The operators used to
...
Página 545
CHEF ( Hammond , 1986 ) is an example of a case - based planner , a program
whose cases are actually complete plans for solving problems in the domain of
cooking . CHEF ' s case library is augmented with a plan - modification library ...
CHEF ( Hammond , 1986 ) is an example of a case - based planner , a program
whose cases are actually complete plans for solving problems in the domain of
cooking . CHEF ' s case library is augmented with a plan - modification library ...
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