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 34
Página 434
... agents on different systems , prob- lem solving can continue even if one system fails . An architecture for distributed reasoning must provide : 1. A mechanism for ensuring that the activities of the various agents in the system are ...
... agents on different systems , prob- lem solving can continue even if one system fails . An architecture for distributed reasoning must provide : 1. A mechanism for ensuring that the activities of the various agents in the system are ...
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 438
... Agents and Two Actions The second approach is one in which we assume that the agents cannot communicate . This may seem to be a very serious restriction , but it is useful to consider it both because it does sometimes arise in the ...
... Agents and Two Actions The second approach is one in which we assume that the agents cannot communicate . This may seem to be a very serious restriction , but it is useful to consider it both because it does sometimes arise in the ...
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