2899 search results - page 470 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
119
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
142
click to vote
TSP
2010
14 years 8 months ago
2010
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
100
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
109
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a blockdiagonalization (BD)...
121
click to vote
JACM
2006
15 years 1 months ago
2006
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...