2252 search results - page 237 / 451 » Lower Bounds for Dynamic Algorithms |
124
click to vote
INFORMS
2000
15 years 3 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
154
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
154
click to vote
ASAP
2009
IEEE
16 years 29 days ago
2009
IEEE
—Molecular dynamics simulation based on discrete event simulation (DMD) is emerging as an alternative to time-step driven molecular dynamics (MD). DMD uses simplified discretize...
106
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...
106
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...