Artificial IntelligenceThe 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. |
Dentro del libro
Resultados 1-3 de 18
Página 313
Initialize BEST - SCORE to the minimum value that STATIC can return . It will be
updated to reflect the best score that can be achieved by an element of
SUCCESSORS . For each element SUCC of SUCCESSORS , do the following : (
a ) ...
Initialize BEST - SCORE to the minimum value that STATIC can return . It will be
updated to reflect the best score that can be achieved by an element of
SUCCESSORS . For each element SUCC of SUCCESSORS , do the following : (
a ) ...
Página 314
So return the structure VALUE = BEST - SCORE PATH = BEST - PATH When the
initial call to MINIMAX returns , the best move from CURRENT is the first element
on PATH . To see how this procedure works , you should trace its execution for ...
So return the structure VALUE = BEST - SCORE PATH = BEST - PATH When the
initial call to MINIMAX returns , the best move from CURRENT is the first element
on PATH . To see how this procedure works , you should trace its execution for ...
Página 315
After K is examined , we see that I is guaranteed a maximum score of 0 , which
means that F is guaranteed a minimum of 0 . But this is less than alpha ' s value
of 3 , so no more branches of I need be considered . The maximizing player ...
After K is examined , we see that I is guaranteed a maximum score of 0 , which
means that F is guaranteed a minimum of 0 . But this is less than alpha ' s value
of 3 , so no more branches of I need be considered . The maximizing player ...
Comentarios de la gente - Escribir un comentario
Calificaciones de los usuarios
| 5 estrellas |
| ||
| 4 estrellas |
| ||
| 3 estrellas |
| ||
| 2 estrellas |
| ||
| 1 estrella |
|
Crítica de los usuarios - Marcar como inadecuado
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
Crítica de los usuarios - Marcar como inadecuado
not soo good to go for novice
Contenido
2 | 28 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 14 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
actions active addition agents algorithm answer applied approach becomes block build called Chapter choose combined complete concept consider constraints contains corresponding define dependency described determine discussed domain efficient example fact Figure function given goal grammar heuristic human idea important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible present problem problem-solving procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation solution solve space specific step stored structure Suppose task techniques things tree true understanding units usually weights
Referencias a este libro
Human-computer Interaction Alan Dix,Alan John Dix,Janet Finlay,Gregory D. Abowd,Russell Beale Sin vista previa disponible - 2003 |
Información bibliográfica
| Título | Artificial Intelligence Artificial Intelligence Series Mac Graw-Hill series in artificial inteligence |
| Autores | Elaine Rich, Kevin Knight, Knight Kevin |
| Edición | 2, ilustrada |
| Editor | McGraw-Hill, 1991 |
| Procedencia del original | Universidad de Michigan |
| Digitalizado | 15 Nov. 2007 |
| ISBN | 0070522634, 9780070522633 |
| Largo | 621 páginas |
| Exportar cita | BiBTeX EndNote RefMan |