1480 search results - page 162 / 296 » Distributed algorithms for weighted problems in sparse graph... |
100
click to vote
JETAI
2008
15 years 20 days ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
90
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
112
Voted
COCOON
2001
Springer
15 years 5 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
106
click to vote
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
115
click to vote
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...