350 search results - page 48 / 70 » Approximation Algorithms for Unique Games |
SPIRE
2001
Springer
13 years 12 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— In this paper, we develop, analyze and implement a congestion control scheme obtained in a noncooperative game framework where each user’s cost function is composed of a pric...
WIOPT
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
TMC
2010
13 years 6 months ago
2010
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...