Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 19
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 317
... PASS- THRESH that we did in MINIMAX to compute BEST - SCORE . We might as well eliminate BEST - SCORE and let PASS - THRESH serve in its place . With these observations , we are in a position to describe the operation of the function ...
... PASS- THRESH that we did in MINIMAX to compute BEST - SCORE . We might as well eliminate BEST - SCORE and let PASS - THRESH serve in its place . With these observations , we are in a position to describe the operation of the function ...
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
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