Wolfgang Banzhaf

You can judge a book by its cover – Evolution of gait controllers based on (2008)

I. History of concept of self-organization II. Example(s) of natural self-organizing systems III. Example(s) of arti cial self-organizing systems

Genetic Programming: An Introduction (2008)

program code analysis

David B. Fogel, James Kennedy, Russell C. Eberhart, Yuhui Shi, Christian Jacob, Edited Peter, ...

FOGA Foundations of Genetic Algorithms Volumes 1–5 Proceedings

A SIMD interpreter for Genetic Programming on GPU Graphics Cards (2008)

W. B. Langdon, Wolfgang Banzhaf

Abstract. Mackey-Glass chaotic time series prediction and nuclear protein classification show the feasibility of evaluating genetic programming populations directly on parallel consumer gaming...

Genetic Programming based DNA Microarray Analysis for Classification of Cancer (2008)

Michael Rosskopf, Heiko A. Schmidt, Udo Feldkamp, Wolfgang Banzhaf

Abstract. In this study the advantages of statistical gene selection are combined with the power of Genetic Programming (GP) to build classifiers for assigning gene expression microarray data samples...

Preprint Revision: 1.30 Complex Systems 2005 15 (4) pp285-306 Repeated Sequences in Linear Genetic Programming Genomes (2008)

Evolving Control Metabolisms (2008)

Biological chromosomes are replete with repetitive sequences, micro satellites, SSR tracts, ALU, etc. in their DNA base sequences. We started looking for similar phenomena in evolutionary...

Systems Analysis D-44221 Dortmund (2008)

for a Robot Abstract This article demonstrates a new method of programming artificial chemistries. It uses the emerging capabilities of the system’s dynamics for informationprocessing purposes. By...

Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database (2008)

Abstract This article reviews the growing body of scienti�c work in arti�cial chemistry. First, common motivations and fundamental concepts are introduced. Second, current research activities are...

Jens Niehaus, Christian Igel, Wolfgang Banzhaf

We describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness...

Empirical Analysis of Different Levels of Meta-Evolution (2008)

Wolfgang Mantschik, Peter Dittrich, Markus Brameier, Wolfgang Banzhaf

In this contribution we analyze different levels of meta-evolution using a graph-based GP system. The system allows to represent individuals of the search space and genetic variation operators in a...

“Going Back to our Roots”: Second Generation (2008)

Jon Timmis, Martyn Amos, Wolfgang Banzhaf

Researchers in the field of biocomputing have, for many years, successfully used the natural world as inspiration for developing systems that are robust, adaptable and capable of generating novel and...

On the Formation of Social Order – Modeling Luhmann’s Double Contingency Problem (2008)

Peter Dittrich, Thomas Kron, Wolfgang Banzhaf

Iterated Mutual Observation with Genetic Programming (2008)

Peter Dittrich, Thomas Kron, Christian Kuck, Wolfgang Banzhaf

ls11-www.cs.uni-dortmund.de www.fernuni-hagen.de/SOZ/SOZ2/Kron This paper introduces a simple model of interacting agents that learn to predict each other. For learning to predict the other’s...

On the Formation of Social Order – Modeling Luhmann’s Double Contingency Problem (2008)

Peter Dittrich, Thomas Kron, Wolfgang Banzhaf

Linear-Tree GP and its comparison with other (2008)

Gp Structures Wolfgang, Wolfgang Kantschik, Wolfgang Banzhaf

In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution...

y (2007)

One of the most general forms of representing and specifying behavior is by using a computer language. We have evaluated the use of the evolutionary technique of Genetic Programming (GP) to directly...

and (2007)

Mesoscopic Analysis of an Artificial Chemistry with Self-organizing Topology (2007)

In an algorithmic artificial chemistry the objects (molecules) are data and the interactions (reactions) among them are defined by an algorithm. The same object can appear in two forms: (1) as a...

Artificial Selection in a System of Self-Replicating Strings (2007)

The analysis of artificial life systems is often much harder than their construction, especially in population-based systems with a huge number of interacting individuals. Due to insufficient results...

Trends Controversies (2007)

the situation in a general setting. Each string is allowed to encounter every other string, much like chemical reactions occur in a well-stirred vessel. Strings are of different sorts, represented by...

The Artificial Evolution, Wolfgang Banzhaf

rather than starting out with such behavior. Naturally, he concluded that we should enact a procession of learning stages during which a machine could "grow" in knowledge. He termed this a...

Wolfgang Banzhaf (2007)

Mesoscopic Analysis of an Artificial Chemistry with Self-organizing Topology (2007)

We present a different approach to directing the evolutionary process through interactive selection of solutions by the human user. First the general context of Interactive Evolution (IE) is set,...

Macroscopic and Microscopic Computation in an Artificial Chemistry (2007)

this paper we present a stepwise mesoscopic analysis method for artificial chemistries, which might be applied to other population-based systems as well. In this mesoscopic analysis the population is...

Peter Dittrich, Wolfgang Banzhaf, Hilmar Rauhe, Jens Ziegler

this paper make use of artificial interactions they point to a strategy for the implementation of parallel algorithms in molecular computation and give insight into the reactor 's design and...

Peter Dittrich, Wolfgang Banzhaf, Hilmar Rauhe and Jens Ziegler (2007)

Peter Dittrich, Wolfgang Banzhaf, Hilmar Rauhe, Jens Ziegler

this paper make use of artificial interactions they point to a strategy for the implementation of parallel algorithms in molecular computation and give insight into the reactor 's design and...

The Chemical Computation Metaphor and Robot Control (2007)

Explicit Control of Diversity and E#ective Variation Distance in Linear Genetic Programming (2007)

d as a reaction matrix (lookup table) to perform the following robot control task: A mobile robot is situated in a torus-like grid world. The world contains substances which can be absorbed by the...

c ○ 2002 Nonlinear Phenomena in Complex Systems On the Dynamics of Competition in a simple Artificial Chemistry (2007)

We investigate structural and semantic distance metrics for linear genetic programs. Causal connections between changes of the genotype and fitness changes form a necessary condition for analyzing...

COMPETITION AS AN ORGANIZATIONAL PRINCIPLE FOR MASSIVELY PARALLEL COMPUTERS? (2007)

We examine a simple system of competing and cooperating entities in terms of the speed of settling their competition. It turns out that the larger the degree of cooperativity among entities the...

Wolfgang Kantschik, Wolfgang Banzhaf

We discuss the idea of using competition as a guiding principle for organizing a parallel computer. We argue that competitive interactions are ubiquous in many systems and deserve to be looked at in...

1 (2007)

Abstract. In recent years dierent genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this...

Arti cial Chemistries- A Review (2007)

Iterated Mutual Observation with Genetic Programming (2007)

1 This article reviews the growing body of scienti c work in Arti cial Chemistry. First, common motivations and fundamental concepts are introduced. Second, cur-rent research activities are discussed...

Peter Dittrich, Thomas Kron, Christian Kuck, Wolfgang Banzhaf

This paper introduces a simple model of interacting agents that learn to predict each other. For learning to predict the other's intended action we apply genetic programming. The strategy of an...

der Universität Dortmund (2007)

Ontogenetic Programming, Peter Schmutter, Diplomarbeit Am, Prof Dr, Wolfgang Banzhaf, ...

To my parents As the research field called Genetic Programming has shown during the last decade, it is possible not only to write computer programs by hand but also to let the computer itself develop...

Multicellular Creatures (2007)

Peter Schmutter, Diplomarbeit Am, Prof Dr, Wolfgang Banzhaf

To my parents As the research field called Genetic Programming has shown during the last decade, it is possible not only to write computer programs by hand but also to let the computer itself develop...

Evolving Teams of Multiple Predictors with Genetic Programming (2007)

Iterated Mutual Observation with Genetic Programming (2007)

This paper reports on the evolution of GP teams in dierent classication and regression problems and compares dierent methods for combining the outputs of the team programs. These include hybrid...

Peter Dittrich, Thomas Kron, Christian Kuck, Wolfgang Banzhaf

ls11-www.cs.uni-dortmund.de www.fernuni-hagen.de/SOZ/SOZ2/Kron This paper introduces a simple model of interacting agents that learn to predict each other. For learning to predict the other’s...

Explicit Control of Diversity (2007)

And Ective Variation, Markus Brameier, Wolfgang Banzhaf

We have investigated structural distance metrics for linear genetic programs. Causal connections between changes of the genotype and changes of the phenotype form a necessary condition for analyzing...

Robert E. Keller, Wolfgang Banzhaf, Jorn Mehnen and Klaus Weinert (2007)

Surface Reconstruction Is, Robert E. Keller, Wolfgang Banzhaf, Jörn Mehnen, Klaus Weinert

Introduction Genetic programming (GP) [Banzhaf et al., 1998] is an evolutionary search process that generates structures of arbitrary shape and size. The most prominent special case of such a...

Survival of the Unfittest? -- The Seceder Model (2007)

And Its Fitness, Peter Dittrich, Wolfgang Banzhaf, Informatik Xi

The seceder model is an extremely simple individual based model which shows how the local tendency to be di#erent gives rise to the formation of hierarchically structured groups, called the seceder...

Network motifs in natural and artificial transcriptional regulatory networks (2007)

Wolfgang Banzhaf, P. Dwight Kuo

networks

Fast genetic programming on GPUs (2007)

Simon Harding, Wolfgang Banzhaf

Abstract. As is typical in evolutionary algorithms, fitness evaluation in GP takes the majority of the computational effort. In this paper we demonstrate the use of the Graphics Processing Unit (GPU)...

K.: Evolving Noisy Oscillatory Dynamics in Genetic Regulatory Networks (2006)

André Leier, P. Dwightkuo, Wolfgang Banzhaf, Kevin Burrage

Abstract. We introduce a genetic programming (GP) approach for evolving genetic networks that demonstrate desired dynamics when simulated as a discrete stochastic process. Our representation of...

ANALYSIS OF PREFERENTIAL NETWORK MOTIF GENERATION IN AN ARTIFICIAL REGULATORY NETWORK MODEL CREATED BY DUPLICATION AND DIVERGENCE (2006)

André Leier, P. Dwight Kuo, Wolfgang Banzhaf

Previous studies on network topology of artificial gene regulatory networks created by whole genome duplication and divergence processes show subgraph distributions similar to gene regulatory...

"Going back to our roots": second generation biocomputing (2005)

Timmis, Jon, Amos, Martyn, Banzhaf, Wolfgang, Tyrrell, Andy

Researchers in the field of biocomputing have, for many years, successfully "harvested and exploited" the natural world for inspiration in developing systems that are robust, adaptable and capable of...

Quantum and classical parallelism in parity algorithms for ensemble quantum computers (2005)

Suter, Dieter, Banzhaf, Wolfgang, Stadelhofer, Ralf

An algorithmic chemistry for genetic programming (2005)

Repeated Sequences in Linear Genetic Programming Genomes (2005)

Abstract. Genetic Programming has been slow at realizing other programming paradigms than conventional, deterministic, sequential von-Neumann type algorithms. In this contribution we discuss a new...

Repeated Sequences in Linear Genetic Programming Genomes (2005)

Introduction It has been long noticed that there are emergent phenomena in genetic programming (GP) runs unintended by the human designer of the algorithm. Early on it was observed that code which...

W.: Repeated sequences in linear genetic programming genomes (2005)

Introduction It has been long noticed that there are emergent phenomena in genetic programming (GP) runs unintended by the human designer of the algorithm. Early on it was observed that code which...

30jähriges Jubiläum des Studiengangs Technische Kybernetik : Reden zum Festakt am 23. Juni 2001 (2004)

Biological chromosomes are replete with repetitive sequences, microsatellites, SSR tracts, ALU, and so on, in their DNA base sequences. We started looking for similar phenomena in evolutionary...

Tilebein, Meike, Allgöwer, Frank, Fritsch, Dieter, Buhlmann, Bettina, Gilles, Ernst-Dieter, Banzhaf, Wolfgang, ...

Inhalt: Tilebein, Meike (Universität Stuttgart, Betriebswirtschaftliches Institut): Vorwort der Vorsitzenden des Vereins Alumni des Studiengangs Technische Kybernetik der Universität Stuttgart e....

30jähriges Jubiläum des Studiengangs Technische Kybernetik : Reden zum Festakt am 23. Juni 2001 (2004)

Tilebein, Meike, Allgöwer, Frank, Fritsch, Dieter, Buhlmann, Bettina, Gilles, Ernst-Dieter, Banzhaf, Wolfgang, ...

Inhalt: Tilebein, Meike (Universität Stuttgart, Betriebswirtschaftliches Institut): Vorwort der Vorsitzenden des Vereins Alumni des Studiengangs Technische Kybernetik der Universität Stuttgart e....

Evolving Dynamics in an Artificial Regulatory Network Model (2004)

P. Dwight Kuo, André Leier, Wolfgang Banzhaf

Abstract. In this paper artificial regulatory networks (ARN) are evolved to match the dynamics of test functions. The ARNs are based on a genome representation generated by a duplication / divergence...

Artificial chemistries - towards constructive dynamic system (2004)

Dynamic subset selection based on a fitness case topology (2004)

Abstract. In this contribution we consider constructive dynamical systems, taking one particular Artificial Chemistry as an example. We argue that constructive dynamical systems are in fact...

On evolutionary design, embodiment, and artificial regulatory networks (2004)

A large training set of fitness cases can critically slow down genetic programming, if no appropriate subset selection method is applied. Such a method allows an individual to be evaluated on a...

Small World and Scale-Free Network Topologies in an Artificial Regulatory Network (2004)

Abstract. In this contribution we consider the idea that successful evolutionary design is best achieved in a networked system. We exemplify this thought by a discussion of artificial regulatory...

P. Dwight Kuo, Wolfgang Banzhaf

Small world and scale--free network topologies commonly exist in natural and artificial systems. Many mechanisms for producing these topologies have been presented in the literature.

Comparison of Selection Strategies for Evolutionary Quantum Circuit Design (2004)

André Leier, Wolfgang Banzhaf

Abstract. Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper we...

Dynamic subset selection based on a fitness case topology (2004)

On the Scalability of Social Order - Modeling the Problem of Double and Multi Contingency Following Luhmann (2003)

A large training set of fitness cases can critically slow down genetic programming, if no appropriate subset selection method is applied. Such a method allows to evaluate an individual on a smaller...

Dittrich, Peter, Kron, Thomas, Banzhaf, Wolfgang

We investigate an algorithmic model based first of all on Luhmann?s description of how so-cial order may originate [N. Luhmann, Soziale Systeme, Frankfurt/Main, Suhrkamp, 1984, pp. 148-179]. In a...

Decreasing the number of evaluations in evolutionary algorithms by using a meta-model of the fitness function (2003)

Evolving hogg’s quantum algorithm using linear-tree gp (2003)

Abstract. In this paper a method is presented that decreases the necessary number of evaluations in Evolutionary Algorithms. A classifier with confidence information is evolved to replace time...

André Leier, Wolfgang Banzhaf

Abstract. Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In this paper a...

Neutral variations cause bloat in linear GP (2003)

More on computational effort statistics for genetic programming (2003)

Abstract. In this contribution we investigate the influence of different variation effects on the growth of code. A mutation-based variant of linear GP is applied that operates with minimum...

Jens Niehaus, Wolfgang Banzhaf

Abstract. In this contribution we take a look at the computational effort statistics as described by Koza. We transfer the notion from generational genetic programming to tournament-selection...

Evolving the Program for a Cell: From French Flags to Boolean Circuits (2003)

Julian F. Miller, Wolfgang Banzhaf

Evolving hogg’s quantum algorithm using linear-tree gp (2003)

André Leier, Wolfgang Banzhaf

Abstract. Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In this paper a...

Software tools for DNA sequence design (2003)

Udo Feldkamp, Wolfgang Banzhaf

Abstract. The design of DNA sequences is a key problem for implementing molecular self-assembly with nucleic acid molecules. These molecules must meet several physical, chemical and logical...

Evolving chess playing programs (2002)

Groß, Roderich, Albrecht, Keno, Kantschik, Wolfgang, Banzhaf, Wolfgang

This contribution introduces a hybrid GP/ES system for the evolution of chess playing computer programs. We discuss the basic system and examine its performance in comparison to pre-existing...

Automatic generation of control programs for walking robots using genetic programming (2002)

Jens Busch, Jens Ziegler, Christian Aue, Andree Ross, Daniel Sawitzki, Wolfgang Banzhaf

Abstract. We present the system SIGEL that combines the simulation and visualization of robots with a Genetic Programming system for the automated evolution of walking. It is designed to...

Lineargraph gp - a new gp structure (2002)

Wolfgang Kantschik, Wolfgang Banzhaf

Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graphstructures. In this...

Explicit control of diversity and effective variation distance in linear genetic programming (2002)

Automatic Generation of Control Programs for Walking Robots Using Genetic Programming (2002)

Abstract. We have investigated structural distance metrics for linear genetic programs. Causal connections between changes of the genotype and changes of the phenotype form a necessary condition for...

Jens Busch, Jens Ziegler, Christian Aue, Andree Ross, Daniel Sawitzki, Wolfgang Banzhaf

We present the system SIGEL that combines the simulation and visualization of robots with a Genetic Programming system for the automated evolution of walking. It is designed to automatically generate...

Automatic generation of control programs for walking robots using genetic programming (2002)

Jens Busch, Jens Ziegler, Christian Aue, Andree Ross, Daniel Sawitzki, Wolfgang Banzhaf

Abstract. We present the system SIGEL that combines the simulation and visualization of robots with a Genetic Programming system for the automated evolution of walking. It is designed to...

Evolution of robot leg movements in a physical simulation (2001)

Linear-tree GP and its comparison with other GP structures (2001)

This paper introduces a Genetic Programming approach to creating patterns of movements for legs of walking robots. It uses a physics-based simulation system to evaluate the fitness of movement...

Wolfgang Kantschik, Wolfgang Banzhaf

Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this...

DNASequenceGenerator - A program for the construction of DNA sequences (2001)

Udo Feldkamp, Sam Saghafi, Wolfgang Banzhaf, Hilmar Rauhe

Abstract. In DNA Computing and DNA nanotechnology the design of proper DNA sequences turned out to be an elementary problem [1−9]. We here present a software program for the construction of sets...

Adaption of operator probabilities in genetic programming (2001)

Jens Niehaus, Wolfgang Banzhaf

Abstract. In this work we tried to reduce the number of free parameters within Genetic Programming without reducing the quality of the results. We developed three new methods to adapt the...

Stability of metabolic and balanced organisations (2001)

Constructing a small humanoid walking robot as a platform for the genetic evolution of walking (2001)

Abstract. We investigate the possible organisations emerging from an artificial chemistry (AC) of colliding molecules in a well stirred reactor. The molecules are generated from 7 basic components...

Jens Ziegler, Krister Wolff, Peter Nordin, Wolfgang Banzhaf

Walking robots form the next challenge in the field of autonomous robots. This paper describes the construction of a fully autonomous humanoid walking robot as a platform for machine learning...

Evolving control metabolisms for a robot (2001)

W.: Evolving teams of predictors with linear genetic programming. Genetic Programming and Evolvable Machines 2(4 (2001)

This paper demonstrates a new method of programming artificial chemistries. It uses the emerging capabilities of the system's dynamics for information processing purposes. By evolution of...

Effective linear genetic programming (2001)

This paper applies the evolution of GP teams to different classification and regression problems and compares different methods for combining the outputs of the team programs. These include hybrid...

Constructing a Small Humanoid Walking Robot as a Platform for the Genetic Evolution of Walking (2001)

Dierent variants of genetic operators are introduced and compared for linear genetic programming including program induction without crossover. Variation strength of crossover and mutations is...

Jens Ziegler, Krister Wolff, Peter Nordin, Wolfgang Banzhaf

Walking robots form the next challenge in the eld of autonomous robots. This paper describes the construction of a fully autonomous humanoid walking robot as a platform for machine learning...

Evolving Control Metabolisms for a Robot (2001)

Evolution of Robot Leg Movements in a Physical Simulation (2001)

This paper demonstrates a new method of programming artificial chemistries. It uses the emerging capabilities of the system's dynamics for information processing purposes. By evolution of...

Adaption of Operator Probabilities in Genetic (2001)

This paper introduces a Genetic Programming approach to creating patterns of movements for legs of walking robots. It uses a physics-based simulation system to evaluate the fitness of movement...

Programming Jens Niehaus, Jens Niehaus, Wolfgang Banzhaf

In this work we tried to reduce the number of free parameters within Genetic Programming without reducing the quality of the results.

Artificial Chemistries - A Review (2001)

Stability of Metabolic and Balanced Organisations (2001)

This article reviews the growing body of scientific work in artificial chemistry.

Pietro Speroni Di, Wolfgang Banzhaf

We investigate the possible organisations emerging from an artificial chemistry (AC) of colliding molecules in a well stirred reactor. The molecules are generated from 7 basic components (atoms),...

Evolving Teams of Multiple Predictors with Genetic Programming (2001)

Effective Linear Genetic Programming (2001)

This paper reports on the evolution of GP teams in different classiffication and regression problems and compares dierent methods for combining the outputs of the team programs. These include hybrid...

Explicit Control of Diversity and Effective Variation Distance in Linear Genetic Programming (2001)

Different variants of genetic operators are introduced and compared for linear genetic programming including program induction without crossover. Variation strength of crossover and mutations is...

J.P.: Seeding Genetic Programming Populations (2000)

We investigate structural and semantic distance metrics for linear genetic programs. Causal connections between changes of the genotype and fitness changes form a necessary condition for analyzing...

Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, W. B. Langdon, J. P. Nordin

Abstract. We show genetic programming (GP) populations can evolve under the influence of a Pareto multi-objective fitness and program size selection scheme, from “perfect ” programs which match...

Abstract: Digital DNA Molecules (2000)

Hilmar Rauhe, Udo Feldkamp, Wolfgang Banzhaf, Jonathan C. Howard

An approach based on programmable self-assembly of DNA oligonucleotides was used to create digital DNA molecules representing binary datastructures which are equivalent to those used in computers....

Towards a theory of organizations (2000)

Peter Dittrich, Wolfgang Banzhaf, Jens Ziegler

In this paper we develop an algebra to describe organizations. Its application is demonstrated with five examples. We start from definitions given by Fontana (1992) of an organization as a closed and...

Private and Public Key DNA steganography (2000)

Christoph Richter, André Leier, Wolfgang Banzhaf, Hilmar Rauhe, Hilmar Rauhe Yz

this paper steganographic approaches to DNA cryptography are presented.

A Vital Two-Dimensional Assembler Automaton (2000)

Peter Dittrich, Mathias Wulf, Wolfgang Banzhaf, Informatik Xi

The aim of this paper is twofold. First it reports on a two-dimensional assembler automaton (called CoreSys ) which is able to support digital life without the need of memory protection. Secondly, we...

Digital DNA Molecules (2000)

Hilmar Rauhe, Gaby Vopper, Udo Feldkamp, Wolfgang Banzhaf, Jonathan C. Howard

: An approach based on programmable self-assembly of DNA oligonucleotides was used to create digital DNA molecules representing binary datastructures which are equivalent to those used in computers....

A DNA Sequence Compiler (2000)

Udo Feldkamp, Wolfgang Banzhaf, Hilmar Rauhe

Various approaches to the self-assembly of molecules have been introduced already 1), 2), 3), 4), 5), 6), 7) . A step further toward flexible design and construction of precisely defined molecules...

Spontaneous Group Formation in the Seceder Model (2000)

Peter Dittrich Fredrik, Peter Dittrich, Fredrik Liljeros, Arne Soulier, Wolfgang Banzhaf

The seceder model shows how the local tendency to be different gives rise to the formation of groups. The model consists of a population of simple entities which reproduce and die. In a single...

Spontaneous Group Formation in the Seceder Model (2000)

Peter Dittrich, Fredrik Liljeros, Arne Soulier, Wolfgang Banzhaf

The seceder model shows how the local tendency to be different gives rise to the formation of groups. The model consists of a population of simple entities which reproduce and die. In a single...

A Comparison of Linear Genetic Programming and Neural Networks in Medical Data Mining (2000)

Evolving a "Nose" for a Robot (2000)

We apply linear genetic programming to several diagnosis problems in medicine. An efficient algorithm is presented that eliminates intron code in linear genetic programs. This results in a...

Seeding Genetic Programming Populations (2000)

The evolution of metabolisms that act as control programms for a small robot leads to the selection of most relevant sensory information. The underlying artificial chemistry evolves efficient...

Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, W. B. Langdon, J. P. Nordin

We show genetic programming (GP) populations can evolve under the influence of a Pareto multi-objective fitness and program size selection scheme, from "perfect" programs which match the...

Efficient evolution of machine code for CISC architectures using instruction blocks and homologous crossover (1999)

Peter Nordin, Wolfgang Banzhaf, Frank Francone

This chapter describes recent advances in genetic programming of machine code. Evolutionary program induction of binary machine code is one of the fastest 1 GP methods and the most well studied...

Empirical analysis of different levels of meta-evolution (1999)

Wolfgang Kantschik, Peter Dittrich, Markus Brameier, Wolfgang Banzhaf

this contribution we analyze different levels of meta-evolution using a graph-based GP system. The system allows to represent individuals of the search space and genetic variation operators in a...

Dynamical Properties of the Fitness Landscape of a GP Controlled Random Morphology Robot (1999)

Peter Dittrich, Andre Skusa, Wolfgang Kantschik, Wolfgang Banzhaf

The aim of this contribution is: (1) to present an easy to maintain robot hardware platform which allows on-line evolutionary experiments and demonstrations; (2) to introduce a simple method to...

Dynamical Properties of the Fitness Landscape of a GP Controlled Random Morphology Robot (1999)

Peter Dittrich, Andre Skusa, Wolfgang Kantschik, Wolfgang Banzhaf

The aim of this contribution is: (1) to present an easy to maintain robot hardware platform which allows on-line evolutionary experiments and demonstrations; (2) to introduce a simple method to...

Cryptography with DNA binary strands (1999)

André Leier, Christoph Richter, Wolfgang Banzhaf, Hilmar Rauhe

Introduction As a medium with high information density, DNA was proposed for computational purposes [Adleman 1994]. Since then several approaches have been investigated like implementations of...

Compression of Effective Size in Genetic Programming (1999)

Peter Nordin, Wolfgang Banzhaf, F.D. Francone

We measure the compression of information in a genetic programming system. The investigation is performed taking introns in the genome into account. We mainly investigate evolution of linear computer...

The Evolution of Genetic Code in Genetic Programming (1999)

Hierarchical Genetic Programming using Local Modules (1999)

In most Genetic Programming (GP) approaches, the space of genotypes, that is the search space, is identical to the space of phenotypes, that is the solution space. Developmental approaches, like...

Banscherus, Dirk, Banzhaf, Wolfgang, Dittrich, Peter

Banzhaf, Wolfang; Banscherus, Dirk; Dittrich, Peter: Hierarchical Genetic Programming using Local Modules

A Comparison of Genetic Programming and Neural Networks in Medical Data Analysis (1998)

Mesoscopic analysis of self-evolution in an artificial chemistry (1998)

We apply an interpreting variant of linear genetic programming to several diagnosis problems in medicine. We compare our results to results obtained with neural networks and argue that genetic...

Charles E. Taylor, Peter Dittrich, Jens Ziegler, Wolfgang Banzhaf

In an algorithmic artificial chemistry the objects (molecules) are data and the interactions (reactions) among them are defined by an algorithm. The same object can appear in two forms: (1) as a...

Mesoscopic Analysis of an Artificial Chemistry with Self-organizing Topology (1998)

C. Wilke, S. Altmeyer, T. Martinetz, Peter Dittrich, Jens Ziegler, Wolfgang Banzhaf

The analysis of artificial life systems is often much harder than their construction, especially in population-based systems with a huge number of interacting individuals. Due to insufficient results...

Self-Evolution in a Constructive Binary String System (1998)

Learning to Move a Robot with Random Morphology (1998)

This paper focuses on the phenomena of evolution whose appearance is notable because no explicit mutation, recombination or artificial selection operators are introduced. We call the system...

Peter Dittrich, Andreas Bürgel, Wolfgang Banzhaf

. Complex robots inspired by biological systems usually consist of many dependent actuators and are difficult to control. If no model is available automatic learning and adaptation methods have to be...

SYSGP -- A C++ library of different GP variants (1998)

Markus Brameier Wolfgang, Wolfgang Kantschik, Peter Dittrich, Wolfgang Banzhaf

In recent years different variants of genetic programming (GP) have emerged all following the basic idea of GP, the automatic evolution of computer programs. Today, three basic forms of...

A Comparison of Genetic Programming and Neural Networks in Medical Data Analysis (1998)

Hierarchical Genetic Programming using Local Modules (1998)

We apply an interpreting variant of linear genetic programming to several diagnosis problems in medicine. We compare our results to results obtained with neural networks and argue that genetic...

Wolfgang Banzhaf Dept, Wolfgang Banzhaf, Dirk Banscherus, Peter Dittrich

This paper presents detailed experimental results for a new modular approach to Genetic Programming, hierarchical GP (hGP) based on the introduction of local modules. A module in a hGP program is...

Genetic Programming for Automatic Design of Self-Adaptive Robots (1998)

Wolfgang Banzhaf, Riccardo Poli, Marc Schoenauer, Stéphane Calderoni, Pierre Marcenac

. The general framework tackled in this paper is the automatic generation of intelligent collective behaviors using genetic programming and reinforcement learning. We define a behavior-based system...

Towards a Metabolic Robot Control System (1998)

Jens Ziegler Peter, Peter Dittrich, Wolfgang Banzhaf

Bacteria must be able to detect rapid changes in their environment and to adapt their metabolism to external fluctuations. They monitor their surroundings with membrane-bound and intra-cellular...

Learning to Move a Robot with Random Morphology (1998)

Phil Husb, Jean-arcady Meyer, Peter Dittrich, Andreas Burgel, Wolfgang Banzhaf

. Complex robots inspired by biological systems usually consist of many dependent actuators and are difficult to control. If no model is available automatic learning and adaptation methods have to be...

Towards a Metabolic Robot Control System (1998)

Jens Ziegler, Peter Dittrich, Wolfgang Banzhaf

INTRODUCTION Bacteria must be able to detect rapid changes in their environment and to adapt their metabolism to external fluctuations. They monitor their surroundings with membrane -bound and...

Evolution of a World Model for a Miniature Robot using Genetic Programming (1998)

Peter Nordin, Wolfgang Banzhaf, Markus Brameier

We have used an automatic programming method called Genetic Programming (GP) for control of a miniature robot. Our earlier work on real-time learning suffered from the drawback of the learning time...

Mesoscopic Analysis of Self-Evolution in an Artificial Chemistry (1998)

SYSGP - A C++ library of different GP variants (1998)

In an algorithmic artificial chemistry the objects (molecules) are data structures and the interactions (reactions) among them are defined by an algorithm. The same object can appear in two forms:...

Markus Brameier, Wolfgang Kantschik, Peter Dittrich, Wolfgang Banzhaf

In recent years different variants of genetic programming (GP) have emerged all following the basic idea of GP, the automatic evolution of computer programs. Today, three basic forms of...

Hierarchical Genetic Programming using Local Modules (1998)

Wolfgang Banzhaf, Dirk Banscherus, Peter Dittrich

This paper presents detailed experimental results for a new modular approach to Genetic Programming, hierarchical GP (hGP) based on the introduction of local modules. A module in a hGP program is...

Evolution of a World Model for a Miniature Robot using Genetic Programming (1998)

Peter Nordin, Wolfgang Banzhaf, Markus Brameier

We have used an automatic programming method called Genetic Programming (GP) for control of a miniature robot. Our earlier work on real-time learning su ered from the drawback of the learning time...

A Comparison of Genetic Programming and Neural Networks in Medical Data Analysis (1998)

SYSGP - A C++ library of different GP variants (1998)

We apply an interpreting variant of linear genetic programming to several diagnosis problems in medicine. We compare our results to results obtained with neural networks and argue that genetic...

Banzhaf, Wolfgang, Brameier, Markus, Dittrich, Peter, Kantschik, Wolfgang

Surface Reconstruction from 3D Point Data with a Genetic Programming/Evolution Strategy hybrid (1998)

Banzhaf, Wolfgang, Keller, Robert E., Mehnen, Jörn, Weinert, Klaus

Surface reconstruction is a hard key problem in the industrial domain of computer-aided design (CAD) applications. A physical object, like a workpiece, must be represented in some standard CAD object...

An On-line Method to Evolve Behavior and to control a Miniature Robot in Real Time with Genetic Programming (1997)

Introns in Nature and in Simulated Structure Evolution (1997)

We present a novel evolutionary approach to robotic control of a real robot based on genetic programming (GP). Our approach uses genetic programming techniques that manipulate machine code to evolve...

Peter Nordin, Wolfgang Banzhaf, Frank D. Francone

. In this study we measure the compression of information in a simulated evolutionary system. We do the investigation taking introns in the genome into account. We mainly investigate evolution of...

Interactive Evolution (1997)

A Topological Structure Based on Hashing - Emergence of a "Spatial" Organisation (1997)

We present a different approach to directing the evolutionary process through interactive selection of solutions by the human user. First the general context of interactive evolution (IE) is set,...

Peter Dittrich and Wolfgang Banzhaf (1997)

A topological structure based on hashing for an algorithmic reaction system is introduced. Hashing, as a very efficient storage method for certain problems, uses an important property of the...

Real Time Control of a Khepera Robot using Genetic Programming (1997)

A topological structure based on hashing for an algorithmic reaction system is introduced. Hashing, as a very efficient storage method for certain problems, uses an important property of the...

Towards a Metabolic Robot Control System (1997)

A computer language is a very general form of representing and specifying an autonomous agent's behavior. The task of planning feasible actions could then simply be reduced to an instance of...

Jens Ziegler, Peter Dittrich, Wolfgang Banzhaf

Bacteria must be able to detect rapid changes in their environment and to adapt their metabolism to external fluctuations. They monitor their surroundings with membrane-bound and intra-cellular...

Generating Adaptive Behavior using Function Regression within Genetic Programming and a Real Robot (1997)

Wolfgang Banzhaf, Peter Nordin, Markus Olmer

We discuss the generation of adaptive behavior for an autonomous robot within the framework of a special kind of function regression used in compiling Genetic Programming (GP). The control strategy...

On Some Emergent Properties of Variable Size Evolutionary Algorithms (1997)

Wolfgang Banzhaf, Frank D. Francone, Peter Nordin

. We argue that variable-length evolutionary algorithms behave qualitatively different from their fixed-length counterparts. We point out some of these differences derived from emergent properties of...

Interactive evolution in the framework of simulated natural evolution, Evolution Artificielle 95 (1996)

The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets (1996)

This paper demonstrates how interactive evolution can be applied to the evolution of simulated natural evolution. Evolutionary algorithms of selection and variation by recombination and/or mutation...

Wolfgang Banzhaf, Frank D. Francone, Peter Nordin

Abstract. Ordinarily, Genetic Programming uses little or no mutation. Crossover is the predominant operator. This study tests the effect of a very aggressive use of the mutation operator on the...

Programmatic Compression of Images and Sound (1996)

Emergent Computation by Catalytic Reactions (1996)

The importance of digital data compression in the future media arena cannot be overestimated. A novel approach to data compression is built on Genetic Programming. This technique has been referred to...

Wolfgang Banzhaf, Peter Dittrich, Hilmar Rauhe

Recently, biochemical systems have been shown to possess interesting computational properties. In a parallel development, the chemical computation metaphor is becoming more and more frequently used...

Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes (1996)

Interactive Evolution in the framework of Simulated Natural Evolution (1996)

In common genetic programming approaches, the space of genotypes, that is the search space, is identical to the space of phenotypes, that is the solution space. Facts and theories from molecular...

Emergent Computation by Catalytic Reactions (1996)

This paper demonstrates how interactive evolution can be applied to the evolution of simulated natural evolution. Evolutionary algorithms of selection and variation by recombination and/or mutation...

Wolfgang Banzhaf, Peter Dittrich, Hilmar Rauhe

Recently, biochemical systems have been shown to possess interesting computational properties. In a parallel development, the chemical computation metaphor is becoming more and more frequently used...

Augmenting Paper Documents with Digital Information in a Mobile Environment (1996)

Dietmar Aust, Lehrstuhl Vii, Heinrich Muller, Prof Dr, Prof Dr, ...

this paper, he walks over to Jim's office to discuss the first draft version. He takes the PaperLink system with him, consisting of his laptop, the highlighting marker with the camera and a...

Evolving real-time behavioral modules for a robot with GP (1996)

Markus Olmer, Peter Nordin, Wolfgang Banzhaf

In this paper we demonstrate an efficient method which divides a control task into smaller sub--tasks. We use a Genetic Programming system that first learns the sub-tasks and then evolves a...

Genetic Reasoning Evolving Proofs with Genetic Search (1996)

Genetic Programming using Mutation, Reproduction and Genotype-Phenotype Mapping from linear binary Genomes into linear LALR(1) Phenotypes (1996)

Most automated reasoning systems relies on human knowledge or heuristics to guide the reasoning or search for proofs. We have evaluated the use of a powerful general search algorithm to search in the...

Genetic Reasoning Evolving Proofs with Genetic Search (1996)

In common GP approaches, the space of genotypes (search space) is identical to the space of phenotypes (solution space). Facts and theories from molecular biology suggest the introduction of...

Peter Nordin, Wolfgang Banzhaf, Lehrstuhl Fur Systemanalyse

Most automated reasoning systems rely on human knowledge or heuristics to guide the reasoning or search for proofs. We have evaluated the use of a powerful general search algorithm to search in the...

Expansion operator for interactive evolution (1995)

A genetic programming system learning obstacle avoiding behavior and controlling a miniature robot in real time (1995)

This paper demonstrates how interactive evolution can be applied to the extrapolation and growth of graphical models. A new operator called expansion is introduced, which plays a significant role in...

Interactive Evolution of Images (1995)

One of the most general forms of representing and specifying behavior is by using a computer language. We have evaluated the use of the evolutionary technique of Genetic Programming (GP) to directly...

Real time evolution of behavior and a world model for a miniature robot using genetic programming (1995)

Systems of selection and variation by recombination and/or mutation can be used to evolve images for computer graphics and animation. Interactive evolution can be used to direct the development of...

Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code (1995)

A very general form of representing and specifying an autonomous agent's behavior is by using a computer language. The task of planning feasible actions could then simply be reduced to an...

Peter Nordin, Wolfgang Banzhaf, Lehrstuhl Fur Systemanalyse, Lehrstuhl Fur Systemanalyse

The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing-complete programs for a register machine. The described...

An Expansion Operator for Interactive Evolution (1995)

Explicitly Defined Introns and Destructive Crossover in Genetic Programming (1995)

This paper demonstrates how interactive evolution can be applied to the extrapolation and growth of graphical models. A new operator called expansion is introduced, which plays a significant role in...

Peter Nordin, Frank Francone, Wolfgang Banzhaf

In Genetic Programming, introns play at least two substantial roles: (1) A structural protection role, allowing the population to preserve highly-fit building blocks; and (2) A global protection...

Genetic Programming Controlling a Miniature Robot (1995)

Real Time Evolution of Behavior and a World Model for a Miniature Robot using Genetic Programming (1995)

We have evaluated the use of Genetic Programming to directly control a miniature robot. The goal of the GP-system was to evolve real-time obstacle avoiding behaviour from sensorial data. The evolved...

Complexity Compression and Evolution (1995)

A very general form of representing and specifying an autonomous agent's behavior is by using a computer language. The task of planning feasible actions could then simply be reduced to an...

Peter Nordin, Wolfgang Banzhaf, Lehrstuhl Fur Systemanalyse, Lehrstuhl Fur Systemanalyse

Compression of information is an important concept in the theory of learning. We argue for the hypothesis that there is an inherent compression pressure towards short, elegant and general solutions...

Interactive evolution of images (1995)

Self-Organisation in a System of Binary Strings (1994)

Systems of selection and variation by recombination and/or mutation can be used to evolve images for computer graphics and animation. Interactive evolution can be used to direct the development of...

A Dynamical Implementation of Self-organizing Maps (1994)

We discuss a system of autocatalytic sequences of binary numbers. Sequences come in two forms, a 1dimensional form (operands) and a 2-dimensional form (operators) that are able to react with each...

Wolfgang Banzhaf, Manfred Schmutz

The standard learning algorithm for self-organizing maps (SOM) involves the two steps of a search for the best matching neuron and of an update of its weight vectors in the neighborhood of this...

Self-replicating Sequences of Binary Numbers - The Build-up of Complexity (1994)

Genotype-Phenotype-Mapping and Neutral Variation - A case study in Genetic Programming (1994)

A recently introduced system of self-replicating sequences of binary numbers (strings) is generalized. It is extended to include strings of arbitrary length. For this purpose, first, the folding...

Wolfgang Banzhaf, Y. Davidor, R. Manner (eds

. We propose the application of a genotype-phenotype mapping to the solution of constrained optimization problems. The method consists of strictly separating the search space of genotypes from the...

Explicit Maintenance of Genetic Diversity on Genospaces (1994)

Self-replicating sequences of binary numbers -- foundations i and ii: General and strings of length n = 4 (1993)

When evolving genotypes, i.e. structures, with an evolutionary algorithm (EA), e.g. genetic programming (GP), genetic diversity, i.e. structural diversity, of each generation is a necessary condition...

Self-replicating sequences of binary numbers -- foundations i and ii: General and strings of length n = 4 (1993)

Abstract. We study an algorithm which allows sequences of binary numbers (strings) to interact with each other. The simplest system of this kind with a population of 4-bit sequences is considered...

Self-replicating sequences of binary numbers (1993)

Abstract. We propose the general framework of a new algorithm, derived from the interactions of chains of RNA, which is capable of self-organization. It considers sequences of binary numbers...

Genetic Programming for Pedestrians (1993)

An algorithm is proposed which allows sequences of binary numbers to interact. We introduce a 2-dimensional matrix form of the sequences achieved by a general folding method. Interactions between 1-...

Wolfgang Banzhaf Systems, Wolfgang Banzhaf

We propose an extension to the Genetic Programming paradigm which allows users of traditional Genetic Algorithms to evolve computer programs. To this end, we have to introduce mechanisms like...

Genetic Programming for Pedestrians (1993)

Immun und Komplementproteine in Serumkonserven und ihre klinische Relevanz / (1987)

We propose an extension to the Genetic Programming paradigm which allows users of traditional Genetic Algorithms to evolve computer programs. To this end, we have to introduce mechanisms like...

Nichtlineare Realisierung der globalen (N=1) Supersymmetrie / (1985)

Thesis (doctoral)--Eberhard-Karls-Universität Tübingen, 1987.

Pathogenese und Ätiologie von AV-Überleitungsstörungen : eine Untersuchung an 147 Patienten mit implantiertem Herzschrittmacher der 1. Medizinischen Klinik des Klinikums rechts der Isar der Techn. Univ. München. (1973)

Thesis (doctoral)--Universität Karlsruhe, 1985.

Pathogenese und Ätiologie von AV-Überleitungsstörungen : eine Untersuchung an 147 Patienten mit implantiertem Herzschrittmacher der 1. Medizinischen Klinik des Klinikums rechts der Isar der Technischen Universität München / (1973)

München, Techn. Univ., Fak. f. Medizin, Diss. 1973.

Perichondritis und Strahlentherapie des Kehlkopfkarzinoms / (1972)

München, Techn. Univ., Diss., 1973.