14548 search results - page 199 / 2910 » The Optimal Path-Matching Problem |
88
Voted
ICCV
2007
IEEE
16 years 2 months 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 ...
91
Voted
EVOW
2009
Springer
15 years 7 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...
101
Voted
GECCO
2005
Springer
15 years 6 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...
87
Voted
CAD
1999
Springer
15 years 7 days ago
1999
Springer
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
108
Voted
EC
2000
15 years 11 days ago
2000
Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied ...