no code implementations • 7 Aug 2017 • Simon M. Lucas, Jialin Liu, Diego Pérez-Liébana
The compact genetic algorithm is an Estimation of Distribution Algorithm for binary optimisation problems.
no code implementations • 13 Jun 2017 • Simon M. Lucas, Jialin Liu, Diego Pérez-Liébana
A frequently used stopping condition in runtime analysis, known as "First Hitting Time", is to stop the algorithm as soon as it encounters the optimal solution.
no code implementations • 22 Jul 2016 • Jialin Liu, Michael Fairbank, Diego Pérez-Liébana, Simon M. Lucas
The OneMax problem is a standard benchmark optimisation problem for a binary search space.
no code implementations • 6 Jul 2016 • Jialin Liu, Diego Pérez-Liébana, Simon M. Lucas
To select an action the algorithm co-evolves two (or in the general case N) populations, one for each player, where each individual is a sequence of actions for the respective player.