Sciweavers

554 search results - page 29 / 111
» Approximability of OFDMA Scheduling
Sort
View
49
Voted
GLOBECOM
2006
IEEE
15 years 3 months ago
Power Optimal Opportunistic Scheduling
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...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
15 years 1 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
AAAI
1997
14 years 11 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 4 months ago
On the optimal solutions of the infinite-horizon linear sensor scheduling problem
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
Wei Zhang, Michael P. Vitus, Jianghai Hu, Alessand...
ICC
2007
IEEE
213views Communications» more  ICC 2007»
15 years 4 months ago
On the Achievable Throughput of MIMO Broadcast Channels with Finite Rate 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