937 search results - page 112 / 188 » Hybrid Evolutionary Algorithm for Solving Global Optimizatio... |
GECCO
2006
Springer
14 years 24 days 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...
DAM
2007
13 years 9 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
GECCO
2006
Springer
14 years 24 days ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
ICCV
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
EAAI
2008
13 years 9 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...