1080 search results - page 40 / 216 » Problem dependent optimization (PDO) |
131
click to vote
SLS
2009
Springer
15 years 10 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
153
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Cooperative coevolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance on this task is influenced by many design decisio...
121
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
137
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper tackles an important aspect of the variational problems involving active contours, which has been largely overlooked so far: the optimization by gradient flows. Classic...
134
click to vote
MP
2006
15 years 3 months ago
2006
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...