A bstract Achieving full moduli stabilisation in type IIB string compactifications for generic
Calabi-Yau threefolds with hundreds of Kähler moduli is notoriously hard. This is due not …

Abstract The Building-Block Hypothesis appeals to the notion of problem decomposition and
the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of …

The immensity of the string landscape and the difficulty of identifying solutions that match the
observed features of particle physics have raised serious questions about the predictive …

There are four primary goals of this dissertation. First, design a competent optimization
algorithm capable of learning and exploiting appropriate problem decomposition by …

We assume that the modality (ie, number of local optima) of a fitness landscape is related to
the difficulty of finding the best point on that landscape by evolutionary computation (eg …

Evolutionary computation (EC), a collective name for a range of metaheuristic black-box
optimization algorithms, is one of the fastest-growing areas in computer science. Many …

Rule-based evolutionary online learning systems, often referred to as Michiganstyle learning
classifier systems (LCSs), were proposed nearly thirty years ago (Holland, 1976; Holland …

This paper presents a generalization of the graph-based genetic programming (GP)
technique known as Cartesian genetic programming (CGP). We have extended CGP by …

The paper studies the role of neutrality in the fitness landscapes associated with the
evolutionary design of digital circuits and particularly the three-bit binary multiplier. For the …

Mutation and crossover are the main search operators of different variants of evolutionary
algorithms. Despite the many discussions on the importance of crossover nobody has …