1331 search results - page 142 / 267 » Complexity bounds for zero-test algorithms |
121
click to vote
EUC
2007
Springer
15 years 9 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, ...
115
click to vote
UAI
2003
15 years 4 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
110
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
130
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
124
click to vote
TWC
2008
15 years 3 months ago
2008
This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available...