Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 41
Página 196
... beliefs were accorded a subordinate status as underlying evidence : a belief about a hotel register , a belief about the prestige of the hotel , a belief about the television , a perhaps unwarranted belief about the veracity of the ...
... beliefs were accorded a subordinate status as underlying evidence : a belief about a hotel register , a belief about the prestige of the hotel , a belief about the television , a perhaps unwarranted belief about the veracity of the ...
Página 236
... belief in h given two observations is the measure of belief given only one observation plus some increment for the second observation . This increment is computed by first taking the difference between 1 ( certainty ) and the belief ...
... belief in h given two observations is the measure of belief given only one observation plus some increment for the second observation . This increment is computed by first taking the difference between 1 ( certainty ) and the belief ...
Página 242
... belief networks . One such algorithm [ Chavez , 1989 ] transforms an arbitrary network into a Markov chain . The idea is to shield a given node probabilistically from most of the other nodes in the network . Stochastic algorithms run ...
... belief networks . One such algorithm [ Chavez , 1989 ] transforms an arbitrary network into a Markov chain . The idea is to shield a given node probabilistically from most of the other nodes in the network . Stochastic algorithms run ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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