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 3
Página 48
... trick . What we would like to do is to plan the entire hand before making that first play . But now it is not possible to do such planning with certainty since we cannot know exactly where all the cards are or what the other players ...
... trick . What we would like to do is to plan the entire hand before making that first play . But now it is not possible to do such planning with certainty since we cannot know exactly where all the cards are or what the other players ...
Página 452
... trick possibly contains points , then play a low card . At last , FOO has translated the rather vague advice " avoid taking points " into a specific , usable heuristic . FOO is able to play a better game of hearts after receiving this ...
... trick possibly contains points , then play a low card . At last , FOO has translated the rather vague advice " avoid taking points " into a specific , usable heuristic . FOO is able to play a better game of hearts after receiving this ...
Página 479
... trick . The space of possible analogies is very large . We do not want to entertain possibilities such as " the stock market is like a roller coaster because it is made of metal . " New Problem Previously Solved Solution to New Problem ...
... trick . The space of possible analogies is very large . We do not want to entertain possibilities such as " the stock market is like a roller coaster because it is made of metal . " New Problem Previously Solved Solution to New Problem ...
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