200 search results - page 24 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
ESANN
2003
13 years 9 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Many scientific applications need to stage large volumes of files from one set of machines to another set of machines in a wide-area network. Efficient execution of such data t...
ICML
2010
IEEE
13 years 8 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 ...
SIGMOD
2008
ACM
13 years 7 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
IPCO
2007
13 years 9 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...