It has long been a desire of computer scientists to develop a computer system that is able to learn and improve without being explicitly programmed to do so. The idea of software that is able to analyse, update and alter itself has been discussed. The thesis is structured as follows: Firstly, we refine and improve the Tartarus problem, proposing it as a benchmark problem for use in GP. Secondly, we establish a mechanism for incorporating self-adaptation into a GP system in order to increase the performance of candidate solutions. Finally, we explore the impact of a fitness bias, inspired by the Dunning-Kruger effect, on the robustness of a GP system. The on-the-fly adaptation of parameter values at runtime can lead to improvements in perfor...
We develop a tree-based genetic programming system, capable of modelling evolvability during evoluti...
Genetic Programming is a type of biological inspired machine learning. It is composed of a populatio...
For empirical research on computer algorithms, it is essential to have a set of benchmark problems o...
Evolutionary Algorithms are search algorithms based on the Darwinian metaphor of “Natural Selection”...
Genetic Algorithms are a class of powerful, robust search techniques based on genetic inheritance an...
We propose a self-adaptive genetic algorithm, called SAGA, for the purposes of improving the usabili...
Parameter tuning in Evolutionary Algorithms (EA) generally result in suboptimal choices of values be...
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solv...
Genetic programming is a metaheuristic search method that uses a population of variable-length compu...
In this thesis, an analysis of self-adaptative evolution strategies (ES) is provided. Evolution stra...
Centre for Intelligent Systems and their Applicationsstudentship 9314680This thesis is an investigat...
A formalism for modelling the dynamics of genetic algorithms using methods from statistical physics,...
Automatically designing algorithms has long been a dream of computer scientists. Early attempts whic...
We review different techniques for improving GA performance. By analysing the fitness landscape, a c...
Genetic Algorithms are bio-inspired metaheuristics that solve optimization problems; they are evolut...
We develop a tree-based genetic programming system, capable of modelling evolvability during evoluti...
Genetic Programming is a type of biological inspired machine learning. It is composed of a populatio...
For empirical research on computer algorithms, it is essential to have a set of benchmark problems o...
Evolutionary Algorithms are search algorithms based on the Darwinian metaphor of “Natural Selection”...
Genetic Algorithms are a class of powerful, robust search techniques based on genetic inheritance an...
We propose a self-adaptive genetic algorithm, called SAGA, for the purposes of improving the usabili...
Parameter tuning in Evolutionary Algorithms (EA) generally result in suboptimal choices of values be...
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solv...
Genetic programming is a metaheuristic search method that uses a population of variable-length compu...
In this thesis, an analysis of self-adaptative evolution strategies (ES) is provided. Evolution stra...
Centre for Intelligent Systems and their Applicationsstudentship 9314680This thesis is an investigat...
A formalism for modelling the dynamics of genetic algorithms using methods from statistical physics,...
Automatically designing algorithms has long been a dream of computer scientists. Early attempts whic...
We review different techniques for improving GA performance. By analysing the fitness landscape, a c...
Genetic Algorithms are bio-inspired metaheuristics that solve optimization problems; they are evolut...
We develop a tree-based genetic programming system, capable of modelling evolvability during evoluti...
Genetic Programming is a type of biological inspired machine learning. It is composed of a populatio...
For empirical research on computer algorithms, it is essential to have a set of benchmark problems o...