554 search results - page 26 / 111 » Approximability of OFDMA Scheduling |
133
click to vote
AAAI
2007
15 years 6 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
141
click to vote
VTC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— Mobile radio networks of the IMT-Advanced systems family promise ubiquitous broadband access and high area coverage, with rates of several 100 MBit/s. They claim to gua...
157
click to vote
TMC
2012
13 years 6 months ago
2012
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
116
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
143
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...