275 search results - page 37 / 55 » On the computational power of iterative auctions |
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
A mechanism for efficient mean-shift belief propagation (MSBP) is introduced. The novelty of our work is to use mean-shift to perform nonparametric mode-seeking on belief surfaces...
87
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
AMC
2010
14 years 9 months ago
2010
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...