2899 search results - page 86 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
147
click to vote
TCOM
2010
15 years 3 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
136
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
147
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
155
click to vote
ESA
1998
Springer
15 years 8 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
148
Voted
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...