1662 search results - page 72 / 333 » The Computational Complexity of Agent Design Problems |
EUROCRYPT
2007
Springer
14 years 22 days ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and ...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
AAMAS
2005
Springer
13 years 8 months ago
2005
Springer
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
IEEEIA
2009
13 years 6 months ago
2009
recently, mobile agents have been used to solve many problems in wireless sensor networks. Agents are usually transferred from a node to another to aggregate the sensed data and si...