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 24
Advantages of Depth-First Search • Depth-first search requires less memory
since only the nodes on the current path are stored. This contrasts with breadth-
first search, where all of the tree that has so far been generated must be stored.
Before we can solve a problem using state space search, we must define an
appropriate state space. For each of the ... Give an example of a problem for
which breadth-first search would work better than depth-first search. Give an
example of ...
Until now, we have really only discussed two systematic control strategies,
breadth-first search and depth-first search (of several varieties). In this section,
we discuss a new method, best-first search, which is a way of combining 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