13 search results - page 3 / 3 » Semi-Online Preemptive Scheduling: One Algorithm for All Var... |
ESA
2009
Springer
14 years 29 days 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...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
IEEEPACT
2009
IEEE
14 years 1 months ago
2009
IEEE
Parallel programming is a requirement in the multi-core era. One of the most promising techniques to make parallel programming available for the general users is the use of parall...