Sciweavers

554 search results - page 59 / 111
» Approximability of OFDMA Scheduling
Sort
View
INFOCOM
2012
IEEE
13 years 6 days ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
14 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
ECRTS
2005
IEEE
15 years 3 months ago
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
COR
2010
121views more  COR 2010»
14 years 10 months ago
A multi-objective approach for robust airline scheduling
We present a memetic approach for multi-objective improvement of robustness influencing features (called robustness objectives) in airline schedules. Improvement of the objectives...
Edmund K. Burke, Patrick De Causmaecker, Geert De ...
JSAC
2007
111views more  JSAC 2007»
14 years 9 months ago
MIMO Broadcast Scheduling with Limited Feedback
Abstract— We consider multiuser scheduling with limited feedback of partial channel state information in MIMO broadcast channels. By using spatial multiplexing at the base statio...
Wei Zhang, Khaled Ben Letaief