Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 20
Página 316
... pass down for the next level to use . The MINIMAX procedure as it stands does not need to treat maximizing and mini ... PASS - THRESH . USE - THRESH is used to compute cutoffs . PASS - THRESH is merely passed to the next level as its USE ...
... pass down for the next level to use . The MINIMAX procedure as it stands does not need to treat maximizing and mini ... PASS - THRESH . USE - THRESH is used to compute cutoffs . PASS - THRESH is merely passed to the next level as its USE ...
Página 318
... Pass - Thresh , then we have found a successor that is better than any that have been examined so far . Record this by doing the following . i . Set Pass - Thresh to NEW - VALUE . ii . The best known path is now from CURRENT to SUCC and ...
... Pass - Thresh , then we have found a successor that is better than any that have been examined so far . Record this by doing the following . i . Set Pass - Thresh to NEW - VALUE . ii . The best known path is now from CURRENT to SUCC and ...
Página 504
... pass and a backward pass . The forward pass involves presenting a sample input to the network and letting activations flow until they reach the output layer . During the backward pass , the network's actual output ( from the forward ...
... pass and a backward pass . The forward pass involves presenting a sample input to the network and letting activations flow until they reach the output layer . During the backward pass , the network's actual output ( from the forward ...
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