415 search results - page 61 / 83 » An efficient approximation for the Generalized Assignment Pr... |
121
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
106
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
112
Voted
ALMOB
2006
15 years 2 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
114
Voted
CORR
2008
Springer
15 years 2 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...
134
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...