1612 search results - page 104 / 323 » Analysing Randomized Distributed Algorithms |
125
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
126
click to vote
PODC
2010
ACM
15 years 6 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...
165
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
112
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper describes the dynamic load-balancing and high performance communication provided in Jcluster, an efficient Java parallel environment. For the efficient loadbalancing,...
118
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...