730 search results - page 28 / 146 » Combinatorics of Monotone Computations |
155
Voted
RTSS
2003
IEEE
15 years 9 months ago
2003
IEEE
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
123
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
112
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
131
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
125
click to vote
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...