218 search results - page 13 / 44 » Subexponential Algorithms for Unique Games and Related Probl... |
116
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We introduce relational temporal difference learning as an effective approach to solving multi-agent Markov decision problems with large state spaces. Our algorithm uses temporal ...
110
Voted
CORR
2008
Springer
15 years 14 days ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This probl...
147
Voted
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Recent advances in cognitive radio (CR) technology have brought about a number of wireless standards that support opportunistic access to available white-space spectrum. Address...
107
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...