Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 85
Página 154
Given that that standardization has been done , it is easy to determine how the
unifier must be used to perform substitutions to create the resolvent . If two
instances of the same variable occur , then they must be given identical
substitutions .
Given that that standardization has been done , it is easy to determine how the
unifier must be used to perform substitutions to create the resolvent . If two
instances of the same variable occur , then they must be given identical
substitutions .
Página 232
Read this expression as the probability of hypothesis H given that we have
observed evidence E . To compute this , we need to take into account the prior
probability of H ( the probability that we would assign to H if we had no evidence )
and ...
Read this expression as the probability of hypothesis H given that we have
observed evidence E . To compute this , we need to take into account the prior
probability of H ( the probability that we would assign to H if we had no evidence )
and ...
Página 514
Output units that seldom win in the competitive learning process can be given
larger biases . In effect , they are given control over a larger portion of the input
space . In this way , units that consistently lose are eventually given a chance to
win ...
Output units that seldom win in the competitive learning process can be given
larger biases . In effect , they are given control over a larger portion of the input
space . In this way , units that consistently lose are eventually given a chance to
win ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
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 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