14739 search results - page 143 / 2948 » An optimization problem on the sphere |
69
Voted
ICCV
2007
IEEE
16 years 11 days ago
2007
IEEE
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
EVOW
2009
Springer
15 years 5 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
82
Voted
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
126
click to vote
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...