Proceedings of the ... Annual National Conference on Artificial Intelligence, Volume 14AAAI, 1997 - Artificial intelligence |
From inside the book
Results 1-3 of 67
Page 822
... agents . The agents want to exchange enough information to identify violations of constraints and to rectify them . One way of ensuring systematic exchange of partial solutions and identification of constraint violations is to order the ...
... agents . The agents want to exchange enough information to identify violations of constraints and to rectify them . One way of ensuring systematic exchange of partial solutions and identification of constraint violations is to order the ...
Page 849
... agent in a multi - agent system ( MAS ) must decide how much his agent will know about other agents . He can choose to either imple- ment this knowledge directly into the agent , or let the agent learn . For example , he might decide to ...
... agent in a multi - agent system ( MAS ) must decide how much his agent will know about other agents . He can choose to either imple- ment this knowledge directly into the agent , or let the agent learn . For example , he might decide to ...
Page 974
... agent that is wrapped around and interfaced with an external application . ( The layer containing these " base applications " is not shown . ) Each of the Scatterbrain agents is responsible for a different room function . For example ...
... agent that is wrapped around and interfaced with an external application . ( The layer containing these " base applications " is not shown . ) Each of the Scatterbrain agents is responsible for a different room function . For example ...
Contents
Agent Architecture | 3 |
Language and Learning | 10 |
Agent Coordination | 16 |
Copyright | |
53 other sections not shown
Other editions - View all
Common terms and phrases
3SAT Abstract action agents algorithm allocation applied approach arc-consistency Artificial Intelligence assignment axioms backtracking Bayesian network behavior Carnegie Mellon University causal CBASlack chatter clauses coloring complexity component Computer constraint satisfaction constraint satisfaction problems context dataset decision defined denoted described description logic distribution document domain dynamic emotion evaluation example expected value Figure formula function goal graph graph coloring GSAT heuristic commitments inference input literals local search logic Logic Programming method minimal node optimal paper parameters performance phase transition planning possible post-failure prob problem instances Proc procedure propagation propositional qualitative quasigroup random reasoning representation Research resource retrievable query robot robustness rule rule-base satisfied scheduling Selman semantics sequence server simulation solution solve spatial specific strategies structure subgraph suffix tree SumHeight techniques temporal Theorem theory tion tree University unsatisfiable variables WSAT www.aaai.org