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 4
Página 325
... Othello Othello is a popular board game that is played on an 8x8 grid with bi - colored pieces . Although computer programs have already achieved world - championship level play [ Rosenbloom , 1982 ; Lee and Mahajan , 1990 ] , humans ...
... Othello Othello is a popular board game that is played on an 8x8 grid with bi - colored pieces . Although computer programs have already achieved world - championship level play [ Rosenbloom , 1982 ; Lee and Mahajan , 1990 ] , humans ...
Página 593
... othello program . Artificial Intelligence 43 ( 1 ) . Lehnert , W. C. 1978. The Process of Question Answering : A Computer Simulation of Cognition . Hillsdale , NJ : Erlbaum . Lehrberger , J. and L. Bourbeau . 1988. Machine Translation ...
... othello program . Artificial Intelligence 43 ( 1 ) . Lehnert , W. C. 1978. The Process of Question Answering : A Computer Simulation of Cognition . Hillsdale , NJ : Erlbaum . Lehrberger , J. and L. Bourbeau . 1988. Machine Translation ...
Página 618
... Othello 325 PAM 421 Paralation Model 431 parallel hardware 433 parallel processing 24 , 125 , 325 , 429 , 430 , 487 parallel relaxation search 489 , 523 parameter adjustment learning 452 PARLOG 431 PARRY 23 parsers 386 PARSIFAL 390 ...
... Othello 325 PAM 421 Paralation Model 431 parallel hardware 433 parallel processing 24 , 125 , 325 , 429 , 430 , 487 parallel relaxation search 489 , 523 parameter adjustment learning 452 PARLOG 431 PARRY 23 parsers 386 PARSIFAL 390 ...
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