Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 12
Página 9
... Tic - Tac - Toe In this section , we present a series of three programs to play tic - tac - toe . The programs in this series increase in : . Their complexity • Their use of generalizations • The clarity of their knowledge • The ...
... Tic - Tac - Toe In this section , we present a series of three programs to play tic - tac - toe . The programs in this series increase in : . Their complexity • Their use of generalizations • The clarity of their knowledge • The ...
Página 11
... tic - tac - toe playing skill will show up in the program's play . And we still cannot generalize any of the program's knowledge to a different domain , such as three - dimensional tic - tac - toe . Program 2 ' This program is identical ...
... tic - tac - toe playing skill will show up in the program's play . And we still cannot generalize any of the program's knowledge to a different domain , such as three - dimensional tic - tac - toe . Program 2 ' This program is identical ...
Página 620
... tic - tac - toe 9 , 43 , 44 , 327 time 293 , 533 time - delay networks 568 TMS 208 , 214 , 221 , 222 , 290 , 304 , 444 , 549 top - down parsing 387 , 391 tower of Hanoi 60 , 62 translation 426 traveling salesman problem 40 , 43 , 44 ...
... tic - tac - toe 9 , 43 , 44 , 327 time 293 , 533 time - delay networks 568 TMS 208 , 214 , 221 , 222 , 290 , 304 , 444 , 549 top - down parsing 387 , 391 tower of Hanoi 60 , 62 translation 426 traveling salesman problem 40 , 43 , 44 ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space