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 30
Página 7
... selected . A program to perform the task is proposed and then tested . Although we have not been completely successful at creating programs that perform all the selected tasks , most scientists believe that many of the problems that ...
... selected . A program to perform the task is proposed and then tested . Although we have not been completely successful at creating programs that perform all the selected tasks , most scientists believe that many of the problems that ...
Página 73
... selected and the process continues . Usually what happens is that a bit of depth - first searching occurs as the ... selected and all the others are rejected , never to be reconsidered . This produces the straightline behavior that is ...
... selected and the process continues . Usually what happens is that a bit of depth - first searching occurs as the ... selected and all the others are rejected , never to be reconsidered . This produces the straightline behavior that is ...
Página 98
... selected for expansion . • How operators to be applied to that node are selected . • Whether an optimal solution can be guaranteed . • Whether a given state may end up being considered more than once . • How many state descriptions must ...
... selected for expansion . • How operators to be applied to that node are selected . • Whether an optimal solution can be guaranteed . • Whether a given state may end up being considered more than once . • How many state descriptions must ...
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