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 84
Página 97
... RESULT , the state that would result if O were applied in O - START . ( c ) If ( FIRST - PART ← MEA ( CURRENT , O - START ) ) and ( LAST - PART ← MEA ( O - RESULT , GOAL ) ) are successful , then signal success and return the result ...
... RESULT , the state that would result if O were applied in O - START . ( c ) If ( FIRST - PART ← MEA ( CURRENT , O - START ) ) and ( LAST - PART ← MEA ( O - RESULT , GOAL ) ) are successful , then signal success and return the result ...
Página 313
... ( RESULT - SUCC ) . This will cause it to reflect the merits of the position from the opposite perspective from that ... result of attaching SUCC to the front of PATH ( RESULT - SUCC ) . 3OPPOSITE is a function that returns PLAYER - TWO ...
... ( RESULT - SUCC ) . This will cause it to reflect the merits of the position from the opposite perspective from that ... result of attaching SUCC to the front of PATH ( RESULT - SUCC ) . 3OPPOSITE is a function that returns PLAYER - TWO ...
Página 318
... result of attaching SUCC to the front of PATH ( RESULT - SUCC ) . ( d ) If Pass - Thresh ( reflecting the current best value ) is not better than Use- Thresh , then we should stop examining this branch . But both thresholds and values ...
... result of attaching SUCC to the front of PATH ( RESULT - SUCC ) . ( d ) If Pass - Thresh ( reflecting the current best value ) is not better than Use- Thresh , then we should stop examining this branch . But both thresholds and values ...
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