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 62
The algorithm has a built-in strategy for each move it may have to make. It makes
the odd-numbered moves if it is playing X, the even-numbered moves if it is
playing O. The strategy for each turn is as follows: Turn=l Turn=2 Turn=3 Turn=4
Strategies. So far, we have completely ignored the question of how to decide
which rule to apply next during the process ... Suppose we implemented the
simple control strategy of starting each time at the top of the list of rules and
choosing the ...
The program is capable of finding a proof by itself then it does not matter what
strategy the program takes to find the proof. It can use, for example, the resolution
procedure (see Chapter 5), which can be very efficient but which does not appear
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