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 48
Best-First. Search. Until now, we have really only discussed two systematic
control strategies, breadth-first search and ... best-first search, which is a way of
combining the advantages of both depth-first and breadth-first search into a
(5+1) Figure 3.5: h' Overestimates h longer than the best solution. An interesting
question is, "Of what practical ... But then we are back to breadth-first search,
which is admissible but not efficient. But there is a corollary to this theorem that is
When would best-first search be worse than simple breadth-first search? 2.
Suppose we have a problem that we intend to solve using a heuristic best-first
search procedure. We need to decide whether to implement it as a tree search or
as a ...
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