Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 33
Página 514
... connectionist networks is still at a primitive stage . 18.3.1 Connectionist Speech Speech recognition is a difficult perceptual task ( as we see in Chapter 21 ) . Connectionist networks have been applied to a number of problems in ...
... connectionist networks is still at a primitive stage . 18.3.1 Connectionist Speech Speech recognition is a difficult perceptual task ( as we see in Chapter 21 ) . Connectionist networks have been applied to a number of problems in ...
Página 524
... Connectionist knowledge representation offers other advantages besides learnability . Touretzky and Geva [ 1987 ] discuss the fluidity and richness of connectionist represen- tations . In connectionist models , concepts are represented ...
... Connectionist knowledge representation offers other advantages besides learnability . Touretzky and Geva [ 1987 ] discuss the fluidity and richness of connectionist represen- tations . In connectionist models , concepts are represented ...
Página 525
... connectionist framework . Touretzky and Hinton [ 1988 ] describe a connectionist production system , and Derthick [ 1988 ] describes a connectionist semantic network . A third idea is to program a symbolic system with the basic ...
... connectionist framework . Touretzky and Hinton [ 1988 ] describe a connectionist production system , and Derthick [ 1988 ] describes a connectionist semantic network . A third idea is to program a symbolic system with the basic ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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