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 62
Página 9
... elements ( 39 ) , each element of which is a nine - element vector . The contents of this vector are chosen specifically to allow the algorithm to work . The Algorithm To make a move , do the following : 1. View the vector Board as a ...
... elements ( 39 ) , each element of which is a nine - element vector . The contents of this vector are chosen specifically to allow the algorithm to work . The Algorithm To make a move , do the following : 1. View the vector Board as a ...
Página 258
... element - of . Pee Wee Reese is an element of the set of fielders . Thus he is also an element of all of the supersets of fielders , including major league baseball players and people . The transitivity of isa that we have taken for ...
... element - of . Pee Wee Reese is an element of the set of fielders . Thus he is also an element of all of the supersets of fielders , including major league baseball players and people . The transitivity of isa that we have taken for ...
Página 549
Elaine Rich, Kevin Knight. DEFEAT : poor resetability of ELEMENT due to : sequential level count of ELEMENT greater than 2 by : ELEMENT is directly resetable The DESIGN ADVISOR gives advice to a chip designer , who can accept or reject ...
Elaine Rich, Kevin Knight. DEFEAT : poor resetability of ELEMENT due to : sequential level count of ELEMENT greater than 2 by : ELEMENT is directly resetable The DESIGN ADVISOR gives advice to a chip designer , who can accept or reject ...
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