200 search results - page 16 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
144
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
74
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
131
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
120
Voted
AAAI
2007
15 years 5 months ago
2007
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...
139
Voted
JCO
2010
15 years 1 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...