554 search results - page 26 / 111 » Approximability of OFDMA Scheduling |
AAAI
2007
15 years 23 hour 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...
85
Voted
VTC
2010
IEEE
14 years 8 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...
102
click to vote
TMC
2012
13 years 3 days 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...
71
Voted
CORR
2010
Springer
14 years 9 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...
FOCS
2007
IEEE
15 years 4 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...