554 search results - page 10 / 111 » Approximability of OFDMA Scheduling |
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Relaying and orthogonal frequency division multiple access (OFDMA) are the accepted technologies for emerging wireless communications standards. The activities in many ...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
SISAP
2008
IEEE
15 years 4 months ago
2008
IEEE
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
TCS
2008
14 years 9 months ago
2008
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
DISOPT
2006
14 years 9 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...