1612 search results - page 124 / 323 » Analysing Randomized Distributed Algorithms |
145
click to vote
IPCO
2010
15 years 6 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
197
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
138
click to vote
HIPC
2007
Springer
15 years 11 months ago
2007
Springer
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
135
Voted
SRDS
2005
IEEE
15 years 10 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
276
click to vote
ICDCS
2012
IEEE
13 years 7 months ago
2012
IEEE
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...