Sciweavers

355 search results - page 29 / 71
» A general, fully distributed multi-agent planning algorithm
Sort
View
ENTCS
2006
122views more  ENTCS 2006»
15 years 3 months ago
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Damián Barsotti, Leonor Prensa Nieto, Alwen...
148
Voted
IWCMC
2006
ACM
15 years 9 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
ATAL
2009
Springer
15 years 10 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
147
Voted
ATAL
2003
Springer
15 years 8 months ago
Continual coordination through shared activities
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 ...
Bradley J. Clement, Anthony C. Barrett
123
Voted
PODC
2005
ACM
15 years 9 months ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling