2168 search results - page 166 / 434 » Randomized Algorithms and Complexity Theory |
129
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
164
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
144
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
125
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
124
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...