873 search results - page 14 / 175 » Rates of convergence for Quicksort |
JGO
2010
14 years 10 months ago
2010
121
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
134
Voted
OL
2011
14 years 6 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
107
click to vote
SIAMJO
2010
14 years 6 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
TIT
2011
14 years 6 months ago
2011
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...