This work studies the mGA operator (Micro Genetic Algorithm), that has been proposed in literature as a “local search” operator for optimization with Genetic Algorithm. A new ...
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
We define the Rook Jumping Maze, provide historical perspective, and describe a generation method for such mazes. When applying stochastic local search algorithms to maze design, m...
Todd W. Neller, Adrian Fisher, Munyaradzi T. Choga...
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...