Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 34
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
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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