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 89
CLOSED — nodes that have already been examined. We need to keep these
nodes in memory if we want to search a graph rather than a tree, since whenever
a new node is generated, we need to check whether it has been generated
Initialize the graph to the starting node. 2. Loop until the starting node is labeled
SOLVED or until its cost goes above FUTILITY: (a) Traverse the graph, starting at
the initial node and following the current best path, and accumulate the set of ...
Let GRAPH consist only of the node representing the initial state. (Call this node
INIT.) Compute h'(INIT). 2. Until INIT is labeled SOLVED or until INIT's h' value
becomes greater than FUTILITY, repeat the following procedure: (a) Trace 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