Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 78
... Suppose we resolve this in favor of the path we are currently following . Then we will expand E next . Suppose it too has a single successor F , also judged to be three moves from a goal . We are clearly using up moves and making no ...
... Suppose we resolve this in favor of the path we are currently following . Then we will expand E next . Suppose it too has a single successor F , also judged to be three moves from a goal . We are clearly using up moves and making no ...
Página 232
... Suppose , for example , that we are interested in examining the geological evidence at a particular location to determine whether that would be a good place to dig to find a desired mineral . If we know the prior probabilities of ...
... Suppose , for example , that we are interested in examining the geological evidence at a particular location to determine whether that would be a good place to dig to find a desired mineral . If we know the prior probabilities of ...
Página 244
... Suppose we are given two belief functions m1 and m2 . Let X be the set of subsets of to which my assigns a nonzero ... suppose my corresponds to our belief after observing fever : { Flu , Cold , Pneu } ( 0.6 ) Ө ( 0.4 ) Suppose my ...
... Suppose we are given two belief functions m1 and m2 . Let X be the set of subsets of to which my assigns a nonzero ... suppose my corresponds to our belief after observing fever : { Flu , Cold , Pneu } ( 0.6 ) Ө ( 0.4 ) Suppose my ...
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