We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
We propose a novel energy minimisation framework for the dense reconstruction of stereo image sequences that incorporates data fidelity as well as spatial and temporal regularity....
Ben Appleton, Brian C. Lovell, Carlos Leung, Chang...
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...