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 14
We can state it loosely as follows: Graceful Decay of Admissibility: If h' rarely
overestimates h by more than 6, then the A* algorithm will rarely find a solution
whose cost is more than 6 greater than the cost of the optimal solution.
Like A*, Iterative-Deepening-A* (IDA*) is guaranteed to find an optimal solution,
provided that h' is an admissible heuristic. Because of its depth-first search
technique, IDA* is very efficient with respect to space. IDA* was the first heuristic
We can define rationality as follows: An agent is rational if it behaves in a manner
that is optimal with respect to its goals. Unfortunately, in a complex world, an
agent may not have enough processing power to behave optimally. This leads to
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