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 25
Página 367
Elaine Rich, Kevin Knight. A Figure 14.8 : A Line Drawing with Local Ambiguity Noise in the Input Understanding is the ... Drawing 1. Analyze the problem 14.3 . UNDERSTANDING AS CONSTRAINT SATISFACTION 367 Understanding as Constraint ...
Elaine Rich, Kevin Knight. A Figure 14.8 : A Line Drawing with Local Ambiguity Noise in the Input Understanding is the ... Drawing 1. Analyze the problem 14.3 . UNDERSTANDING AS CONSTRAINT SATISFACTION 367 Understanding as Constraint ...
Página 368
... drawing shown in Figure 14.9 . Assume either that you have been given this drawing as the input or that lower - level routines have already operated to extract these lines from an input photograph . The next step in the analysis process ...
... drawing shown in Figure 14.9 . Assume either that you have been given this drawing as the input or that lower - level routines have already operated to extract these lines from an input photograph . The next step in the analysis process ...
Página 447
... drawn from the same population more efficiently and more effectively the next time . As thus defined , learning covers ... draw heavily on knowledge as their source of power . Knowledge is generally acquired through experience , and such ...
... drawn from the same population more efficiently and more effectively the next time . As thus defined , learning covers ... draw heavily on knowledge as their source of power . Knowledge is generally acquired through experience , and such ...
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