Sciweavers

554 search results - page 79 / 111
» Approximability of OFDMA Scheduling
Sort
View
OPODIS
2010
14 years 7 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
TMC
2011
108views more  TMC 2011»
14 years 4 months ago
Spatial-Temporal Coverage Optimization in Wireless Sensor Networks
—Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while ...
Changlei Liu, Guohong Cao
WICON
2008
14 years 11 months ago
A fluid-flow model for backlog-based CSMA policies
We present a fluid flow model to analyze backlog-based CSMA policies. The model is obtained using a CSMA fixed point approximation that has been recently proposed and analyzed. We...
Atilla Eryilmaz, Peter Marbach, Asuman E. Ozdaglar
IPCO
2004
142views Optimization» more  IPCO 2004»
14 years 11 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
TWC
2008
87views more  TWC 2008»
14 years 9 months ago
Opportunistic Grassmannian Beamforming for Multiuser and Multiantenna Downlink Communications
Scheduling in a broadcast channel based on partial channel-state-information at the transmitter is carried out in an opportunistic way. In this paper, the number of generated beams...
Nizar Zorba, Ana I. Pérez-Neira