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 84
... path . This may cause the current best path to change . This propagation of revised cost estimates back up the tree was not necessary in the best - first search algorithm because only unexpanded nodes were examined . But now expanded ...
... path . This may cause the current best path to change . This propagation of revised cost estimates back up the tree was not necessary in the best - first search algorithm because only unexpanded nodes were examined . But now expanded ...
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