2924 search results - page 85 / 585 » Lower Bounds in Distributed Computing |
149
click to vote
PODS
2012
ACM
13 years 4 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
137
click to vote
JPDC
2006
15 years 2 months ago
2006
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
120
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
111
click to vote
ERSHOV
2003
Springer
15 years 7 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
SPDP
1991
IEEE
15 years 6 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...