269 search results - page 26 / 54 » Optimal Randomized Algorithms for Local Sorting and Set-Maxi... |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
TSP
2010
13 years 2 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
ECCV
2010
Springer
13 years 6 months ago
2010
Springer
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...