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 88
Página 368
... Figure 14.9 . Assume either that you have been given this drawing as the input or that lower - level routines have already operated to extract these ... Figure 14.10 : Some Trihedral Figures Figure 14.11 : Some 368 CHAPTER 14. UNDERSTANDING.
... Figure 14.9 . Assume either that you have been given this drawing as the input or that lower - level routines have already operated to extract these ... Figure 14.10 : Some Trihedral Figures Figure 14.11 : Some 368 CHAPTER 14. UNDERSTANDING.
Página 371
Elaine Rich, Kevin Knight. A Figure 14.15 : A Figure Occupying One Octant divide 3 - space into eight parts ( called octants ) since each individual face divides the space in half and none of the faces can be coplanar . Trihedral figures ...
Elaine Rich, Kevin Knight. A Figure 14.15 : A Figure Occupying One Octant divide 3 - space into eight parts ( called octants ) since each individual face divides the space in half and none of the faces can be coplanar . Trihedral figures ...
Página 464
... Figure 17.8 : Representation Language for Cars origin : Japan manufacturer : X1 color : X2 decade : X3 type : Economy Figure 17.9 : The Concept " Japanese economy car " economy car . Now the learning problem is : Given a representation ...
... Figure 17.8 : Representation Language for Cars origin : Japan manufacturer : X1 color : X2 decade : X3 type : Economy Figure 17.9 : The Concept " Japanese economy car " economy car . Now the learning problem is : Given a representation ...
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