Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 33
Página 435
... agents in a distributed system . Using such operators , it is possible for each agent to build a model of both itself and the other agents with which it must interact . The self - descriptive model is necessary to enable the agent to ...
... agents in a distributed system . Using such operators , it is possible for each agent to build a model of both itself and the other agents with which it must interact . The self - descriptive model is necessary to enable the agent to ...
Página 437
... agent can use to attain its goals , taking into account what will probably happen as a result of what the other agents in its environment are likely to do . Sometimes , the other agents are cooperating to achieve the same goal ...
... agent can use to attain its goals , taking into account what will probably happen as a result of what the other agents in its environment are likely to do . Sometimes , the other agents are cooperating to achieve the same goal ...
Página 443
... agents 5. Kernels , of which there is one for each processor , which handle such functions as message routing and I / O transfers A MACE problem - solving agent maintains models of other agents . A model that an agent P has of some other ...
... agents 5. Kernels , of which there is one for each processor , which handle such functions as message routing and I / O transfers A MACE problem - solving agent maintains models of other agents . A model that an agent P has of some other ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's