Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 82
Página 35
Until it becomes possible to automate this process , it must be done by hand ,
however . For simple problems , such as chess or the water jug , this is not very
difficult . The problems are artificial and highly structured . For other problems ...
Until it becomes possible to automate this process , it must be done by hand ,
however . For simple problems , such as chess or the water jug , this is not very
difficult . The problems are artificial and highly structured . For other problems ...
Página 375
( a ) Using the set of possible vertex labelings given in Figure 14 . 17 , attach to V
a list of its possible labelings . ( b ) See whether some of these labelings can be
eliminated on the basis of local constraints . To do this , examine each vertex A ...
( a ) Using the set of possible vertex labelings given in Figure 14 . 17 , attach to V
a list of its possible labelings . ( b ) See whether some of these labelings can be
eliminated on the basis of local constraints . To do this , examine each vertex A ...
Página 435
Using such operators , it is possible for each agent to build a model of both itself
and the other agents with which it must interact . The self - descriptive model is
necessary to enable the agent to know when it should get help from others and to
...
Using such operators , it is possible for each agent to build a model of both itself
and the other agents with which it must interact . The self - descriptive model is
necessary to enable the agent to know when it should get help from others and to
...
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