93 search results - page 9 / 19 » A Survey on Approximation Algorithms for Scheduling with Mac... |
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ML
2002
ACM
13 years 7 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
ESA
2006
Springer
13 years 11 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 ...