554 search results - page 41 / 111 » Approximability of OFDMA Scheduling |
167
Voted
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
154
Voted
IWQOS
2001
Springer
15 years 9 months ago
2001
Springer
A novel algorithm for buffer management and packet scheduling is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, cal...
136
Voted
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
152
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
142
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...