Search Results for author: Diego Pérez-Liébana

Found 4 papers, 0 papers with code

Efficient Noisy Optimisation with the Sliding Window Compact Genetic Algorithm

no code implementations7 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.

Evaluating Noisy Optimisation Algorithms: First Hitting Time is Problematic

no code implementations13 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.

Optimal resampling for the noisy OneMax problem

no code implementations22 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.

Rolling Horizon Coevolutionary Planning for Two-Player Video Games

no code implementations6 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.

Decision Making Vocal Bursts Valence Prediction

Cannot find the paper you are looking for? You can Submit a new open access paper.