McGraw-Hill, 1991 - 621 páginas
The 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.
Resultados 1-3 de 46
One other issue we should consider at this point is that of search trees versus
search graphs. As mentioned above, we can think of ... search space may really
be an arbitrary directed graph rather than a tree. For example, in the tree shown
If it does not, simply add it to the graph just as for a tree. 3. If it does already exist,
then do the following: (a) Set the node that is being expanded to point to the
already existing node corresponding to its successor rather than to the new one.
Graphs. Another kind of structure, the AND-OR graph (or tree), is useful for
representing the solution of problems that can be solved by decomposing them
into a set of smaller problems, all of which must then be solved. This
decomposition, or ...
Comentarios de la gente - Escribir un comentario
Calificaciones de los usuarios
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
not soo good to go for novice
What Is Artificial Intelligence?
Problems Problem Spaces and Search
Heuristic Search Techniques
Derechos de autor
Otras 21 secciones no mostradas