1612 search results - page 271 / 323 » Analysing Randomized Distributed Algorithms |
111
click to vote
SIAMCOMP
2011
14 years 4 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
117
click to vote
IMC
2006
ACM
15 years 3 months ago
2006
ACM
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
CONSTRAINTS
2006
14 years 9 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...