74 search results - page 10 / 15 » Random Debaters and the Hardness of Approximating Stochastic... |
120
click to vote
CVPR
2009
IEEE
15 years 7 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
100
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...