Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 88
Página 51
... path is definitely not the solution to the salesman's problem . These two examples illustrate the difference between any - path problems and best- path problems . Best - path problems are , in general , computationally harder than any ...
... path is definitely not the solution to the salesman's problem . These two examples illustrate the difference between any - path problems and best- path problems . Best - path problems are , in general , computationally harder than any ...
Página 77
... path in g ( OLD ) , and update ƒ ' ( OLD ) . ( d ) If SUCCESSOR was not on OPEN , see if it is on CLOSED . If so , call the node on CLOSED OLD and add OLD to the list of BESTNODE's successors . Check to see if the new path or the old path ...
... path in g ( OLD ) , and update ƒ ' ( OLD ) . ( d ) If SUCCESSOR was not on OPEN , see if it is on CLOSED . If so , call the node on CLOSED OLD and add OLD to the list of BESTNODE's successors . Check to see if the new path or the old path ...
Página 318
... PATH = BEST - PATH 5. Return the structure VALUE = Pass - Thresh PATH = BEST - PATH The effectiveness of the alpha - beta procedure depends greatly on the order in which paths are examined . If the worst paths are examined first , then ...
... PATH = BEST - PATH 5. Return the structure VALUE = Pass - Thresh PATH = BEST - PATH The effectiveness of the alpha - beta procedure depends greatly on the order in which paths are examined . If the worst paths are examined first , then ...
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