2914 search results - page 122 / 583 » Optimization by Stochastic Continuation |
112
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
174
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...
151
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
178
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
127
click to vote
CCE
2004
15 years 3 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...