2814 search results - page 64 / 563 » Competitive Analysis of Distributed Algorithms |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the n...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
DAC
2004
ACM
14 years 11 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
SPAA
2009
ACM
14 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...