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 58
Página 364
... Components Level of Interaction among Components In most interesting understanding contexts , each input is composed of several com- ponents ( lines , words , symbols , or whatever ) . The mapping process is the simplest if each component ...
... Components Level of Interaction among Components In most interesting understanding contexts , each input is composed of several com- ponents ( lines , words , symbols , or whatever ) . The mapping process is the simplest if each component ...
Página 488
... Components in digital computers , on the other hand , must operate perfectly . Why ? Such components store bits of information that are available nowhere else in the computer : the failure of one component means a loss of information ...
... Components in digital computers , on the other hand , must operate perfectly . Why ? Such components store bits of information that are available nowhere else in the computer : the failure of one component means a loss of information ...
Página 532
... components . Because the components are connected , they influence one another . The constraint satisfaction technique ( Chapters 3 and 14 ) is one efficient way of propagating a change in one component to other nearby components ...
... components . Because the components are connected , they influence one another . The constraint satisfaction technique ( Chapters 3 and 14 ) is one efficient way of propagating a change in one component to other nearby components ...
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