Sciweavers

96 search results - page 18 / 20
» Approximating the maximum quadratic assignment problem
Sort
View
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
DAC
2006
ACM
14 years 9 months ago
Optimality study of resource binding with multi-Vdds
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
Deming Chen, Jason Cong, Yiping Fan, Junjuan Xu
INFOCOM
2008
IEEE
14 years 3 months ago
Cell Selection in 4G Cellular Networks
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabr...
FOCS
2007
IEEE
14 years 2 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 9 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani