3 papers
cs.NE2026
Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions
Duc-Cuong Dang, Roman Kalkreuth, Andre Opris
Cartesian Genetic Programming (CGP) is among the practical and popular forms of Genetic Programming as it uses a graph-based representation of programs. This paper presents a first…
cs.NE2026
SPEA2: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees
Duc-Cuong Dang, Andre Opris, Dirk Sudholt
The Strength Pareto Evolutionary Algorithm 2 (SPEA2) is a popular and prominent evolutionary algorithm for solving multi-objective optimisation problems. Despite its popularity, th…
cs.AI2024
Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem
Duc-Cuong Dang, Aneta Neumann, Frank Neumann +2
Quality diversity (QD) algorithms have shown to provide sets of high quality solutions for challenging problems in robotics, games, and combinatorial optimisation. So far, theoreti…