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 67
Página 269
... known to have high visual salience . The more specific slot uniform - color then inherits this property , so it too is known to have high visual salience . The slot color also illustrates the use of the transfers - through slot , which ...
... known to have high visual salience . The more specific slot uniform - color then inherits this property , so it too is known to have high visual salience . The slot color also illustrates the use of the transfers - through slot , which ...
Página 318
... 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 attaching SUCC to the front of PATH ( RESULT - SUCC ) ...
... 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 attaching SUCC to the front of PATH ( RESULT - SUCC ) ...
Página 548
... known , and there is a massbus that has been assigned at least one disk drive and that should support additional disk drives , and the type of cable needed to connect the disk drive to the previous device on the massbus is known then ...
... known , and there is a massbus that has been assigned at least one disk drive and that should support additional disk drives , and the type of cable needed to connect the disk drive to the previous device on the massbus is known then ...
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