Sciweavers

3563 search results - page 539 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
141
Voted
ATMOS
2008
118views Optimization» more  ATMOS 2008»
15 years 6 months ago
Recoverable Robustness for Railway Rolling Stock Planning
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
Valentina Cacchiani, Alberto Caprara, Laura Galli,...
152
Voted
AAAI
2004
15 years 6 months ago
Regrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
Russell Bent, Pascal Van Hentenryck
AIPS
2004
15 years 6 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
NIPS
1993
15 years 6 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr
146
Voted
ESA
2010
Springer
149views Algorithms» more  ESA 2010»
15 years 5 months ago
Non-clairvoyant Speed Scaling for Weighted Flow Time
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow ti...
Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee