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 11
Página 489
... active unit to deactivate a neighboring unit . The network operates as follows . A random unit is chosen . If any of its neighbors are active , the unit computes the sum of the weights on the connections to those active neighbors . If ...
... active unit to deactivate a neighboring unit . The network operates as follows . A random unit is chosen . If any of its neighbors are active , the unit computes the sum of the weights on the connections to those active neighbors . If ...
Página 513
... active.'1 4. Adjust the weights on the input lines that lead to the single active output unit : Aw ; = n xj - n nw ; for all j = 1 , ... , n m where wj Xj is the weight on the connection from input unit j to the active output unit , is ...
... active.'1 4. Adjust the weights on the input lines that lead to the single active output unit : Aw ; = n xj - n nw ; for all j = 1 , ... , n m where wj Xj is the weight on the connection from input unit j to the active output unit , is ...
Página 521
... active if any object is located within its receptive field . There is a unit associated with each zone — the zone is called the unit's receptive field.14 Whenever an object is located in a unit's receptive field , the unit becomes active ...
... active if any object is located within its receptive field . There is a unit associated with each zone — the zone is called the unit's receptive field.14 Whenever an object is located in a unit's receptive field , the unit becomes active ...
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