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 16
Página 75
... Note that g is not an estimate of anything ; it is known to be the exact sum of the costs of applying each of the rules that were applied along the best path to the node . The function h ' is an estimate of the additional cost of ...
... Note that g is not an estimate of anything ; it is known to be the exact sum of the costs of applying each of the rules that were applied along the best path to the node . The function h ' is an estimate of the additional cost of ...
Página 467
... ( Note : The G set must be specialized only to descriptions that are within the current version space , not outside of it . ) Here are the available specializations : 2To make this example concise , we skip slot names in the descriptions ...
... ( Note : The G set must be specialized only to descriptions that are within the current version space , not outside of it . ) Here are the available specializations : 2To make this example concise , we skip slot names in the descriptions ...
Página 514
... Note the nonlinear decision surfaces created by backpropagation learning . Speech production - the problem of translating text into speech rather than vice versa - has also been attacked with neural networks . Speech production is ...
... Note the nonlinear decision surfaces created by backpropagation learning . Speech production - the problem of translating text into speech rather than vice versa - has also been attacked with neural networks . Speech production is ...
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