3475 search results - page 66 / 695 » Backbones in Optimization and Approximation |
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
4OR
2008
13 years 10 months ago
2008
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
ECCC
2000
13 years 10 months ago
2000
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 ...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
KR
2004
Springer
14 years 3 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...