2714 search results - page 55 / 543 » Approximation Schemes for Scheduling |
103
Voted
ESA
2009
Springer
15 years 7 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...
113
click to vote
ESA
2006
Springer
15 years 4 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 ...
102
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
ADHOC
2010
15 years 19 days ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
75
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...