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 90
Total: (8850) Figure 2.15: One Path among the Cities other paths to make sure
that none of them is shorter. In this case, as can be seen from Figure 2.16, the first
path is definitely not the solution to the salesman's problem. These two examples
If SUCCESSOR is cheaper, then reset OLD's parent link to point to BESTNODE,
record the new cheaper path in g(OLD), and update /'(OLD). (d) If SUCCESSOR
was not on OPEN, see if it is on CLOSED. If so, call the node on CLOSED OLD ...
So set BEST-PATH to the result of attaching SUCC to the front of PATH(RESULT-
SUCC). (d) If Pass-Thresh (reflecting the current best value) is not better than Use
- Thresh, then we should stop examining this branch. But both thresholds and ...
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