2252 search results - page 432 / 451 » Lower Bounds for Dynamic Algorithms |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a two-sided economic search model in which agents are searching for beneficial pairwise partnerships. In each search stage, each of the agents is randomly mat...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Cooperative checkpointing, in which the system dynamically skips checkpoints requested by applications at runtime, can exploit system-level information to improve performance and ...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...