2084 search results - page 274 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
103
click to vote
HIPC
2007
Springer
15 years 1 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
101
click to vote
IJBC
2008
14 years 8 months ago
2008
Fractional generalizations of the Poisson process and branching Furry process are considered. The link between characteristics of the processes, fractional differential equations ...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...