Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 46
Página 23
... stored , with each stimulus image , a cue that it could later pass through the discrimination net to try to find the correct response image . But it stored as a cue only as much information about the response syllable as was necessary ...
... stored , with each stimulus image , a cue that it could later pass through the discrimination net to try to find the correct response image . But it stored as a cue only as much information about the response syllable as was necessary ...
Página 112
... stored explicitly for Three Finger Brown , we follow the instance attribute to Pitcher and extract the value stored there . Now we observe one of the critical characteristics of property inheritance , namely that it may produce default ...
... stored explicitly for Three Finger Brown , we follow the instance attribute to Pitcher and extract the value stored there . Now we observe one of the critical characteristics of property inheritance , namely that it may produce default ...
Página 450
... stored value than it would be to recompute it , there must be a way to access the appropriate stored value quickly . In Samuel's program , this was done by indexing board positions by a few important characteristics , such as the number ...
... stored value than it would be to recompute it , there must be a way to access the appropriate stored value quickly . In Samuel's program , this was done by indexing board positions by a few important characteristics , such as the number ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's