2084 search results - page 165 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
122
Voted
COLT
2008
Springer
15 years 6 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
152
click to vote
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a uti...
145
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
140
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, first order diffusion load balancing algorithms for totally dynamic networks are investigated. Totally dynamic networks are networks in which the topology may chan...
208
click to vote
SPAA
1993
ACM
15 years 9 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...