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 13
Página 79
... optimal solution . The formalization and proof of this corollary will be left as an exercise . The third observation ... optimal in that it generates the fewest nodes in the process of finding a solution to a problem . Under other ...
... optimal solution . The formalization and proof of this corollary will be left as an exercise . The third observation ... optimal in that it generates the fewest nodes in the process of finding a solution to a problem . Under other ...
Página 324
... optimal solution , provided that h ' is an admissible heuristic . Because of its depth - first search technique , IDA * is very efficient with respect to space . IDA * was the first heuristic search algorithm to find optimal solution ...
... optimal solution , provided that h ' is an admissible heuristic . Because of its depth - first search technique , IDA * is very efficient with respect to space . IDA * was the first heuristic search algorithm to find optimal solution ...
Página 437
... optimal with respect to its goals . Unfortunately , in a complex world , an agent may not have enough processing power to behave optimally . This leads to a slightly weaker , but more useful , notion of bounded rationality [ Simon ...
... optimal with respect to its goals . Unfortunately , in a complex world , an agent may not have enough processing power to behave optimally . This leads to a slightly weaker , but more useful , notion of bounded rationality [ Simon ...
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