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 54
Página 48
... hand , will need to be solved by a system that expends a great deal of effort making each decision since the decision must be final . Some irrecoverable problems can be solved by recoverable style methods used in a planning process , in ...
... hand , will need to be solved by a system that expends a great deal of effort making each decision since the decision must be final . Some irrecoverable problems can be solved by recoverable style methods used in a planning process , in ...
Página 181
... hand . You are likely to jerk your hand away . While this could be construed as goal - directed behavior , it is modeled more naturally by the recognize - act cycle characteristic of forward - chaining rule systems . In forward ...
... hand . You are likely to jerk your hand away . While this could be construed as goal - directed behavior , it is modeled more naturally by the recognize - act cycle characteristic of forward - chaining rule systems . In forward ...
Página 190
... hand , if we prefer states that were generated earlier in time , we will get breadth - first behavior . If we prefer any state that looks better than the current state ( according to some heuristic function ) , we will get hill climbing ...
... hand , if we prefer states that were generated earlier in time , we will get breadth - first behavior . If we prefer any state that looks better than the current state ( according to some heuristic function ) , we will get hill climbing ...
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