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 21
Página 32
... configuration and is represented implicitly by the index position . The right side of each rule describes the operation to be performed and is represented by a nine - element vector that corresponds to the resulting board configuration ...
... configuration and is represented implicitly by the index position . The right side of each rule describes the operation to be performed and is represented by a nine - element vector that corresponds to the resulting board configuration ...
Página 66
... configuration into another . Actually , one rule will suffice . It says simply pick a block and rotate it 90 degrees in any direction . Having provided these definitions , the next step is to generate a starting configuration . This can ...
... configuration into another . Actually , one rule will suffice . It says simply pick a block and rotate it 90 degrees in any direction . Having provided these definitions , the next step is to generate a starting configuration . This can ...
Página 177
... configuration ( s ) at the root of the tree . Generate the next level of the tree by finding all the rules whose left sides match the root node and using their right sides to create the new configurations . Generate the next level by ...
... configuration ( s ) at the root of the tree . Generate the next level of the tree by finding all the rules whose left sides match the root node and using their right sides to create the new configurations . Generate the next level by ...
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