Artificial Intelligence, Volumen1What is artificial intelligence?; Problem solving; Problems and problem spaces; Basic problem-solving methods; Game playing; Knowledge representation; Knowledge representation using predicate logic; Knowledge representation using other logics; Structured representation of knowledge; Advanced topics; Advanced problem-solving systems; Natural language understanding; Perception; Learning; Implementing A.lI. systems: languages and machines; Conclusion; References; Index. |
Dentro del libro
Resultados 1-3 de 75
Página 44
If we do follow one path successfully to the answer , there is no reason to go back
and see if some other path might also lead to a solution . But now consider again
the traveling salesman problem . Our goal is to find the shortest route that visits ...
If we do follow one path successfully to the answer , there is no reason to go back
and see if some other path might also lead to a solution . But now consider again
the traveling salesman problem . Our goal is to find the shortest route that visits ...
Página 81
Now we must decide whether OLD's parent link should be reset to point to
BESTNODE . It should be if the path we have just found to SUCCESSOR is
cheaper than the current best path to OLD ( since SUCCESSOR and OLD are
really the ...
Now we must decide whether OLD's parent link should be reset to point to
BESTNODE . It should be if the path we have just found to SUCCESSOR is
cheaper than the current best path to OLD ( since SUCCESSOR and OLD are
really the ...
Página 125
The best known path is now from CURRENT to SUCC and then on to the
appropriate path from SUCC as determined by the recursive call to MINIMAX - A -
B . So set BEST - PATH to the result of appending SUCC to PATH ( RESULT -
SUCC ) .
The best known path is now from CURRENT to SUCC and then on to the
appropriate path from SUCC as determined by the recursive call to MINIMAX - A -
B . So set BEST - PATH to the result of appending SUCC to PATH ( RESULT -
SUCC ) .
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
PART ONE PROBLEM SOLVING | 23 |
Basic Problem Solving Methods | 55 |
Game Playing | 113 |
Derechos de autor | |
Otras 10 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
additional algorithm already answer appear applied approach appropriate attempt block called chapter choose clauses combined complete concept consider constraint contains corresponding dependency described determine discussed domain evidence example exploit explore fact frame function given goal grammar graph heuristic important indicates initial input interpretation involved John kinds knowledge known labelings language lead learning logic look match means methods move necessary node objects occur operators particular path performed position possible preconditions predicate present probability problem procedure produce prove question reasoning representation represented result rules satisfied script selected semantic sentence shown in Figure shows simple single situation solution solve space specific statements step stored structure Suppose task techniques things tion tree true understanding variety
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, Volumen1 Artificial Intelligence International student edition International student edition: MacGraw-Hill McGraw-Hill computer science series McGraw-Hill international editions McGraw-Hill series in artificial intelligence Synthesis lectures on computer science |
| Autores | Elaine Rich, Rich Elaine |
| Edición | 6, ilustrada, reimpresa |
| Editor | McGraw-Hill, 1983 |
| ISBN | 0070522618, 9780070522619 |
| Largo | 436 páginas |
| Exportar cita | BiBTeX EndNote RefMan |