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 18
3.3.1 OR Graphs Depth - first search is good because it allows a solution to be
found without all competing branches having to be ... Usually what happens is
that a bit of depth - first searching occurs as the most promising branch is
Conduct a depth - first search , pruning any branch when its total cost function ( 8
+ h ' ) exceeds THRESHOLD . If a solution path is found during the search , return
it . 3. Otherwise , increment THRESHOLD by the minimum amount it was ...
For example , when we add a test that has more than two branches , it is possible
that one branch has no corresponding training instances . In that case , we can
either leave the node unlabeled , or we can attempt to guess a label based on ...
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