4565 search results - page 238 / 913 » Time Optimal Self-Stabilizing Algorithms |
70
Voted
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
— We introduce spectral shaping of timing mismatches in time-interleaved analog-to-digital converters (TIADCs). We show how to reorder the channel ADC sequence in order to achiev...
101
click to vote
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
192
click to vote
VLDB
2007
ACM
16 years 27 days ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
104
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
103
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...