554 search results - page 67 / 111 » Approximability of OFDMA Scheduling |
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
SODA
2012
ACM
13 years 5 days ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We present and evaluate the design of Deep Maize, our entry in the 2005 Trading Agent Competition Supply Chain Management scenario. The central idea is to decompose the problem by...
100
click to vote
BIOWIRE
2007
Springer
15 years 1 months ago
2007
Springer
Desynchronization is a novel primitive for sensor networks: it implies that nodes perfectly interleave periodic events to occur in a round-robin schedule. This primitive can be us...