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 80
In that case, update the cost of getting to this node and to any successors that this
node may already have. The basic idea of this algorithm is simple. Unfortunately,
it is rarely the case that graph traversal algorithms are simple to write correctly.
The problem reduction algorithm we just described is a simplification of an
algorithm described in Martelli and Montanari , Martelli and Montanari [
1978], and Nilsson . Nilsson calls it the AO* algorithm, the name we
In Chapter 4, we presented a simple algorithm for inheritance. But that algorithm
assumed that the isa hierarchy was a tree. This is often not the case. To support
flexible representations of knowledge about the world, it is necessary to allow the
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