2084 search results - page 124 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
153
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
Current technology trends have led to the growing impact of both inter-die and intra-die process variations on circuit performance. While it is imperative to model parameter varia...
155
click to vote
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
134
click to vote
EUC
2007
Springer
15 years 11 months ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
131
click to vote
TSP
2010
14 years 11 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
133
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...