Sciweavers

641 search results - page 24 / 129
» On robust online scheduling algorithms
Sort
View
DAC
2010
ACM
13 years 11 months ago
A probabilistic and energy-efficient scheduling approach for online application in real-time systems
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the ex...
Thorsten Zitterell, Christoph Scholl
SOFSEM
2010
Springer
14 years 4 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
COCOA
2008
Springer
13 years 9 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
AAAI
2007
13 years 10 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
DAGM
2006
Springer
13 years 11 months ago
On-Line, Incremental Learning of a Robust Active Shape Model
Abstract. Active Shape Models are commonly used to recognize and locate different aspects of known rigid objects. However, they require an off-line learning stage, such that the ex...
Michael Fussenegger, Peter M. Roth, Horst Bischof,...