2252 search results - page 94 / 451 » Lower Bounds for Dynamic Algorithms |
124
click to vote
RTSS
2005
IEEE
15 years 8 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
110
click to vote
STOC
1999
ACM
15 years 7 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
100
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
211
click to vote
ICAART
2010
INSTICC
16 years 9 days ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
102
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this work, we propose adaptive frequency-domain biased estimation algorithms with mechanisms to automatically adjust the shrinkage factors. The proposed estimation algorithms i...