554 search results - page 53 / 111 » Approximability of OFDMA Scheduling |
WICON
2008
14 years 11 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
WSC
2004
14 years 11 months ago
2004
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...
109
click to vote
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
JSSPP
2005
Springer
15 years 3 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...