15485 search results - page 531 / 3097 » Computing Optimal Subsets |
191
click to vote
SIGECOM
2008
ACM
15 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
158
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper proposes two techniques for low-complexity rate-distortion (R-D) optimized streaming of packetized video. These techniques enable computing packet transmission schedule...
209
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
The development of optimized codes is time-consuming and requires extensive architecture, compiler, and language expertise, therefore, computational scientists are often forced to ...
224
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
172
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...