Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 84
Página 43
... function that evaluates individual problem states and determines how desirable they are . A heuristic function is a function that maps from problem state descriptions to measures of desirability , usually represented as numbers . Which ...
... function that evaluates individual problem states and determines how desirable they are . A heuristic function is a function that maps from problem state descriptions to measures of desirability , usually represented as numbers . Which ...
Página 70
... function now works perfectly . Unfortunately , it is not always possible to construct such a perfect heuristic function . For example , consider again the problem of driving downtown . The perfect heuristic function would need to have ...
... function now works perfectly . Unfortunately , it is not always possible to construct such a perfect heuristic function . For example , consider again the problem of driving downtown . The perfect heuristic function would need to have ...
Página 309
... function is similar to that of the heuristic function h ' in the A * algorithm : in the absence of complete information , choose the most promising position . Of course , the static evaluation function could simply be applied directly ...
... function is similar to that of the heuristic function h ' in the A * algorithm : in the absence of complete information , choose the most promising position . Of course , the static evaluation function could simply be applied directly ...
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