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...
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 ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
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...
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 ...
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...