554 search results - page 25 / 111 » Approximability of OFDMA Scheduling |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
69
Voted
WSC
2007
15 years 17 hour ago
2007
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
105
click to vote
IFIPTCS
2010
14 years 7 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
WCNC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We establish a closed form formula of the other-cell interference factor f for omni-directional and sectored cellular networks, as a function of the location of the mobile. Tha...
RTSS
2000
IEEE
15 years 2 months ago
2000
IEEE
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...