2084 search results - page 308 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
ASPDAC
2009
ACM
15 years 4 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
ETT
2007
14 years 9 months ago
2007
Abstract— The performance of the widely applied timedomain channel estimation for SISO- and MIMO-OFDM systems strongly depends on the preciseness of information regarding maximum...
PODS
2004
ACM
15 years 10 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
SRDS
1999
IEEE
15 years 2 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...