Sciweavers

279 search results - page 18 / 56
» Online Algorithms for Scheduling with Machine Activation Cos...
Sort
View
ECCC
2000
140views more  ECCC 2000»
13 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
KDD
2007
ACM
202views Data Mining» more  KDD 2007»
14 years 8 months ago
Support feature machine for classification of abnormal brain activity
In this study, a novel multidimensional time series classification technique, namely support feature machine (SFM), is proposed. SFM is inspired by the optimization model of suppo...
Wanpracha Art Chaovalitwongse, Ya-Ju Fan, Rajesh C...
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 4 days ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
13 years 5 months ago
Tradeoff between Energy and Throughput for Online Deadline Scheduling
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
Ho-Leung Chan, Tak Wah Lam, Rongbin Li
ECRTS
2002
IEEE
14 years 18 days ago
Robustness results concerning EDF scheduling upon uniform multiprocessors
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
Sanjoy K. Baruah