Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 46
Página 329
However , for more complicated problem domains , it becomes important to be
able to work on small pieces of a problem separately and then to combine the
partial solutions at the end into a complete problem solution . Unless we can do
this ...
However , for more complicated problem domains , it becomes important to be
able to work on small pieces of a problem separately and then to combine the
partial solutions at the end into a complete problem solution . Unless we can do
this ...
Página 400
Unfortunately , to solve the lexical disambiguation problem completely , it
becomes necessary to introduce more and more finely grained semantic markers
. For example , to interpret the sentence about Susan ' s diamond correctly , we
must ...
Unfortunately , to solve the lexical disambiguation problem completely , it
becomes necessary to introduce more and more finely grained semantic markers
. For example , to interpret the sentence about Susan ' s diamond correctly , we
must ...
Página 528
If a cell is dead , it becomes living only if it is surrounded by exactly three living
cells . Otherwise , it remains dead . For example : → cell becomes dead → cell
stays living → cell stays dead → cell becomes living ( a ) Create input - output
pairs ...
If a cell is dead , it becomes living only if it is surrounded by exactly three living
cells . Otherwise , it remains dead . For example : → cell becomes dead → cell
stays living → cell stays dead → cell becomes living ( a ) Create input - output
pairs ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
Contenido
Problems Problem Spaces and Search | 29 |
7 | 61 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 11 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 choose 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