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 21
Depth-first search is good because it allows a solution to be found without all
competing branches having to be expanded. Breadth-first search is good
because it does not get trapped on dead-end paths. One way of combining the
two is to ...
This is not too surprising when you consider that what any depth-first search
program does is to "make a guess" at something, thus creating a branch in the
search space. If that branch eventually dies out, then we know that at least one
There are many variations on this basic algorithm. For example, when we add a
test that has more than two branches, it is possible that one branch has no
corresponding training instances. In that case, we can either leave the node
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