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 29
Página 24
... Success One of the most important questions to answer in any scientific or engineering research project is " How will we know if we have succeeded ? " Artificial intelligence is no exception . How will we know if we have constructed a ...
... Success One of the most important questions to answer in any scientific or engineering research project is " How will we know if we have succeeded ? " Artificial intelligence is no exception . How will we know if we have constructed a ...
Página 39
... success . 2. Otherwise , do the following until success or failure is signaled : ( a ) Generate a successor , E , of the initial state . If there are no more successors , signal failure . ( b ) Call Depth - First Search with E as the ...
... success . 2. Otherwise , do the following until success or failure is signaled : ( a ) Generate a successor , E , of the initial state . If there are no more successors , signal failure . ( b ) Call Depth - First Search with E as the ...
Página 97
... successful , then signal success and return the result of concatenating FIRST - PART , O , and LAST - PART . Many of the details of this process have been omitted in this discussion . In particular , the order in which differences are ...
... successful , then signal success and return the result of concatenating FIRST - PART , O , and LAST - PART . Many of the details of this process have been omitted in this discussion . In particular , the order in which differences are ...
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