Sciweavers

1612 search results - page 55 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
IAT
2006
IEEE
15 years 3 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
QEST
2009
IEEE
15 years 4 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
MASCOTS
2010
14 years 11 months ago
Distributed Routing for Vehicular Ad Hoc Networks: Throughput-Delay Tradeoff
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
Ali Abedi, Majid Ghaderi, Carey L. Williamson
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
CP
2004
Springer
15 years 3 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore