Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 84
Página 78
Suppose it has only one successor E , which also appears to be three moves
away from a goal . Now f ' ( E ) is 5 , the same as f ' ( C ) . Suppose we resolve this
in favor of the path we are currently following . Then we will expand E next .
Suppose it has only one successor E , which also appears to be three moves
away from a goal . Now f ' ( E ) is 5 , the same as f ' ( C ) . Suppose we resolve this
in favor of the path we are currently following . Then we will expand E next .
Página 139
Suppose , for example , that , in addition to the facts we already have , we add the
following . Pompeian ( Paulus ) [ loyalto ( Paulus , Caesar ) V hate ( Paulus ,
Caesar ) ] In other words , suppose we want to make Paulus an exception to the ...
Suppose , for example , that , in addition to the facts we already have , we add the
following . Pompeian ( Paulus ) [ loyalto ( Paulus , Caesar ) V hate ( Paulus ,
Caesar ) ] In other words , suppose we want to make Paulus an exception to the ...
Página 244
Suppose we are given two belief functions m , and m2 . Let X be the set of
subsets of to which m ... For example , suppose mi corresponds to our belief after
observing fever : { Flu , Cold , Pneu } ( 0 . 6 ) ( 0 . 4 ) Suppose m2 corresponds to
our ...
Suppose we are given two belief functions m , and m2 . Let X be the set of
subsets of to which m ... For example , suppose mi corresponds to our belief after
observing fever : { Flu , Cold , Pneu } ( 0 . 6 ) ( 0 . 4 ) Suppose m2 corresponds to
our ...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
What Is Artificial Intelligence? | 3 |
Problems Problem Spaces and Search | 29 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 21 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights