Computers thatprogram themselves' has long been an aim of computer scientists. Recently
genetic programming (GP) has started to show its promise by automatically evolving …

Page 1 TIC Institut für Technische Informatik und Kommunikationsnetze Computer
Engineering and Networks Laboratory TIK-SCHRIFTENREIHE NR. 17 Tobias Blickle …

Method and apparatus are disclosed for the development and implementation of virtual
robot's (bot's) directed natural language interaction With computer users. Bots employing the …

Within the optimization community, the question of how to generate new optimization
problems has been gaining traction in recent years. Within topics such as instance space …

In this work we aim to empirically characterize two important dynamical aspects of GP
search: the evolution of diversity and the propagation of inheritance patterns. Diversity is …

This paper presents an algorithm for the discovery of building blocks in genetic
programming (GP) called adaptive representation through learning (ARL). The central idea …

Research into the utility of non {coding segments, or introns, in genetic {based encodings
has shown that they expedite the evolution of solutions in domains by protecting building …

Coding segments are those subsegments of the chromosome that contribute positively to the
fitness evaluation of the chromosome. Clique detection is a NP-complete problem in which …

As stated in the building block hypothesis, we expect genetic algorithms (GAs) to create
building blocks (BBs) and combine them appropriately in the evolutionary process …

Schema theory is the most well-known model of evolutionary algorithms. Imitating from
genetic algorithms (GA), nearly all schemata defined for genetic programming (GP) refer to a …