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 11
Página 85
There is one important limitation of the algorithm we have just described . It fails
to take into account any interaction between subgoals . A simple example of this
failure is shown in Figure 3.10 . Assuming that both node C and node E ultimately
...
There is one important limitation of the algorithm we have just described . It fails
to take into account any interaction between subgoals . A simple example of this
failure is shown in Figure 3.10 . Assuming that both node C and node E ultimately
...
Página 191
One reason why a path may lead to difficulties is that subgoals can interact with
one another . In the process of solving one subgoal , we may undo our solution of
a previous subgoal . Search control knowledge can tell us something about the ...
One reason why a path may lead to difficulties is that subgoals can interact with
one another . In the process of solving one subgoal , we may undo our solution of
a previous subgoal . Search control knowledge can tell us something about the ...
Página 551
It then uses the left sides of those rules ( the preconditions ) to set up subgoals
whose success would enable the rules to be invoked . These subgoals are again
matched against rules , and their preconditions are used to set up additional ...
It then uses the left sides of those rules ( the preconditions ) to set up subgoals
whose success would enable the rules to be invoked . These subgoals are again
matched against rules , and their preconditions are used to set up additional ...
Comentarios de la gente - Escribir un comentario
Calificaciones de los usuarios
| 5 estrellas |
| ||
| 4 estrellas |
| ||
| 3 estrellas |
| ||
| 2 estrellas |
| ||
| 1 estrella |
|
Crítica de los usuarios - Marcar como inadecuado
very poor book for novice.Assumes u already know AI and the language is not at all user friendly.One has to read a sentence repeatedly to get a grasp and some times even then u don't understand.Go for other books much better than this
Crítica de los usuarios - Marcar como inadecuado
not soo good to go for novice
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 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
Referencias a este libro
Human-computer Interaction Alan Dix,Alan John Dix,Janet Finlay,Gregory D. Abowd,Russell Beale Sin vista previa disponible - 2003 |
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 |
| Procedencia del original | Universidad de Michigan |
| Digitalizado | 15 Nov. 2007 |
| ISBN | 0070522634, 9780070522633 |
| Largo | 621 páginas |
| Exportar cita | BiBTeX EndNote RefMan |