269 search results - page 11 / 54 » A branch and bound method for stochastic global optimization |
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
LION
2009
Springer
15 years 4 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
ISVC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we propose a new method for pairwise rigid point set registration. We pay special attention to noise robustness, outlier resistance and global optimal alignment. The ...
COR
2006
14 years 9 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
83
Voted
AAAI
1998
14 years 11 months ago
1998
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...