Memory with Memory in Genetic Programming (2009)
Riccardo Poli, Nicholas Freitag McPhee, Luca Citi, Ellery Crane
We introduce Memory with Memory Genetic Programming (MwM-GP), where we use soft assignments and soft return operations. Instead of having the new value completely overwrite the old value of registers...
Memory with Memory in Genetic Programming (2009)
Riccardo Poli, Nicholas Freitag McPhee, Luca Citi, Ellery Crane
We introduce Memory with Memory Genetic Programming (MwM-GP), where we use soft assignments and soft return operations. Instead of having the new value completely overwrite the old value of registers...
A Histogram-matching Approach to the Evolution of Bin-packing Strategies (2008)
Riccardo Poli, John Woodward, Edmund K. Burke
Abstract — We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the bin-gap histogram....
ABSTRACT Markov Chain Models of Bare-Bones Particle Swarm Optimizers (2008)
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in analyses of PSOs. Using...
Information Perspective of Optimization (2008)
Yossi Borenstein, Riccardo Poli
Abstract. In this paper we relate information theory and Kolmogorov Complexity (KC) to optimization in the black box scenario. We define the set of all possible decisions an algorithm might make...
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been tested empirically on a...
Object Tracking and Segmentation with a Population of Artificial Neural Networks (2008)
Luca Mussi, Riccardo Poli, Stefano Cagnoni
Abstract. We present a study concerning the use of artificial neural networks for object tracking/segmentation in surveillance video sequences. A number of artificial creatures, conceptually,...
Alberto Moraglio, Yourim Yoon, Riccardo Poli, Byung-ro Moon
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of...
A Histogram-matching Approach to the Evolution of Bin-packing Strategies (2008)
Riccardo Poli, John Woodward, Edmund K. Burke
Abstract — We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the bin-gap histogram....
Cycle Crossover for Permutations with Repetitions Application to Graph Partitioning (2008)
Alberto Moraglio, Yong-hyuk Kim, Yourim Yoon, Byung-ro Moon, Riccardo Poli
Abstract. Geometric crossover is a representation-independent generalisation of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the...
Geometric Particle Swarm Optimisation (2008)
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
Abstract. Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimization (PSO) and evolutionary algorithms....
Geometric Crossover for Permutations with Repetitions: Application to Graph Partitioning (2008)
Alberto Moraglio, Yong-hyuk Kim, Yourim Yoon, Byung-ro Moon, Riccardo Poli
Abstract. Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the...
A Linear Estimation-of-Distribution GP System (2008)
Riccardo Poli, Nicholas F. Mcphee
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of triplets of...
N-gram GP: Early results and half-baked ideas (2008)
McPhee, Nicholas Freitag, Poli, Riccardo
In this talk I present N-gram GP, a system for evolving linear GP programs using an EDA style system to update the probabilities of different 3-grams (triplets) of instructions. I then pick apart...
Analysis of the Publications on the Applications of Particle Swarm Optimisation (2008)
Particle swarm optimisation (PSO) has been enormously successful. Within little more than a decade hundreds of papers have reported successful applications of PSO. In fact, there are so many of them,...
Geometric Particle Swarm Optimization (2008)
Alberto Moraglio, Cecilia Di Chio, Julian Togelius, Riccardo Poli
Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimisation (PSO) and evolutionary algorithms. This...
For stochastic optimisation algorithms, knowing the probability distribution with which an algorithm allocates new samples in the search space is very important, since this explains how the algorithm...
Parallel Distributed Genetic Programming Applied to the Evolution of Natural Language (2007)
Abstract. This paper describes an application of Parallel Distributed Genetic Programming (PDGP) to the problem of inducing recognisers for natural language from positive and negative examples. PDGP...
A few schema theorems for GP have been proposed in the literature in the last few years. One of their main weaknesses is that they provide only a lower bound for the expected value of the number of...
Nicholas Freitag Mcphee, Riccardo Poli, Jonathan E. Rowe
schema theory analysis of mutation size biases in
Minimal Polynomial Logic: Properties and Extensions (2007)
Riccardo Poli And, Riccardo Poli, Riccardo Poli, Manfred Kerber, Manfred Kerber
Minimal Polynomial Logic (MPL) is a generalisation of classical propositional logic which allows truth values in the continuous interval [0; 1] and in which propositions are represented by...
Peter Martin, Riccardo Poli, Wivenhoe Park, Co Sq Uk
This paper analyses the behavior of a hardware implementation of Genetic Programming using Field Programmable Gate Arrays. Three crossover operators that limit the lengths of programs are analyzed. A...
Chapter 8 Chapter 8 A Genetic Programming Tutorial (2007)
Abstract: Genetic programming is a technique to automatically discover computer programs using principles of Darwinian evolution. This chapter introduces the basics of genetic programming. To make...
Running head: ANNs HELP IMAGE SEGMENTATION (2007)
Guido Valli, Riccardo Poli, Stefano Cagnoni, Prof G. Valli, Via S. Marta
Neural networks and prior knowledge help the segmentation of medical images
Genetic Design of Optimum Linegr gnd Non-linegr Detectors (2007)
Address Dr, Riccardo Poli, Riccardo Poli, Riccardo Poll, Stefano Cagnoni, Stefano Cagnoni, ...
This paper describes an approach to the design of optimum QRS detectors. We report on detectors including a linear or non-linear polynomial filter, which enhances and rectifies the QRS complex, and a...
The recovery of the three-dimensional shape of anatomical structures is one of the most important problems in the field of medical imaging as the quantitative, computer-based assessment of such a...
Parallel Distributed Genetic Programming Applied to the Evolution of Natural Language (2007)
Abstract. This paper describes an application of Parallel Distributed Genetic Programming (PDGP) to the problem of inducing recognisers for natural language from positive and negative examples. PDGP...
Chapter 13: Sub-machine-code Genetic Programming (2007)
Riccardo Poli, William B. Langdon
CPUs are often seen as sequential, however they have a high degree of internal parallelism, typically operating on 32 or 64 bits simultaneously. This chapter explores the idea of exploiting this...
Evolving Neural Networks Using a Dual Representation with a Combined Crossover Operator (2007)
Joao Carlos, Figueira Pujol, Riccardo Poli
Abstractn this paper a new approach to the evolution of neural networks is presented. A linear chromosome combined with a grid-based representation of the network, and a new crossover operator, allow...
João Carlos, Figueira Pujol, Riccardo Poli
Abstract. Recurrent neural networks are particularly useful for processing time sequences and simulating dynamical systems. However, methods for building recurrent architectures have been hindered by...
Address for Correspondence (2007)
Guido Valli, Riccardo Poli, Riccardo Poli
In this paper we present a algorithm for the real-time enhancement and detection of blood vessels in medical images. The algorithm is based on a set of linear filters sensitive to vessels of...
Dual Network Representation Applied to the Evolution of Neural Controllers (2007)
João Carlos, Figueira Pujol, Riccardo Poli
Abstract. This paper presents a new approachto the evolution of neural networks. A linear chromosome combined with a grid-based representation of the network and a new crossover operator allow the...
Nicholas Freitag Mcphee, Riccardo Poli
schema theory analysis of the evolution of size in genetic programming with linear representations
Nicholas Freitag Mcphee, Riccardo Poli, Jonathan E. Rowe
schema theory analysis of mutation size biases in genetic programming with
Late-Breaking Papers of EuroGP-99 Edited by (2007)
R. Poli, P. Nordin, T. Fogarty (eds, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Markov Models for GP and Variable-length GAs with Homologous Crossover (2007)
Riccardo Poli, Jonathan E. Rowe, Nicholas Freitag Mcphee
In this paper we present a Markov model for GP and variable-length GAs with homologous crossover: a set of operators where the offspring are created preserving the position of the genetic material...
Learning a Navigation Task in Changing Environments by Multi-Task Reinforcement Learning (2007)
A. Grossmann, R. Poli, Riccardo Poli
This work is concerned with practical issues surrounding the application of reinforcement learning to a mobile robot. The robot's task is to navigate in a controlled environment and to collect...
Multi-agent Foreign Exchange Market Modelling via GP (2007)
Abstract. In this work we combine Genetic Programming (GP) and intelligent agents to build a realistic foreign exchange currency market simulator. GP is used to express and evolve trading strategies....
Analysis of the Behavior of a Hardware (2007)
Peter Martin, Riccardo Poli, Wivenhoe Park, Co Sq Uk
This paper analyses the behavior of a hardware implementation of Genetic Programming using Field Programmable Gate Arrays. Three crossover operators that limit the lengths of programs are analyzed. A...
Possible sources of perceptual errors in P300-based speller paradigm (2007)
Caterina Cinel, Riccardo Poli, Luca Citi
Some perceptual phenomena can interfere with character identification in Farwell and Donchin’s P300-based speller paradigm [1]: attentional blink, repetition blindness and other effects caused by...
A simple reformulation of Riemann Zeta function (2007)
Poli, Riccardo, Langdon, William B.
We rewrite Riemann Zeta function as a sum over the primes. Each term of the sum is a product that depends only on the summation index (a prime) and the primes following it.
Genetic Programming An Introductory Tutorial and a Survey of Techniques and Applications (2007)
Riccardo Poli, William B. Langdon, Nicholas F. Mcphee, John R. Koza
1 This paper introduces genetic programming (GP) – a set of evolutionary computation techniques for getting computers to automatically solve problems without having to tell them explicitly how to...
An Analysis of Publications on Particle Swarm Optimisation Applications (2007)
Particle swarm optimisation (PSO) has been enormously successful. Within little more than a decade hundreds of papers have reported successful applications of PSO. In fact, there are so many of them,...
The Sampling Distribution of Particle Swarm Optimisers and their Stability (2007)
Several theoretical analyses of the dynamics of particle swarms have been offered in the literature over the last decade. Virtually all rely on substantial simplifications, often including the...
Inbreeding properties of geometric crossover and non-geometric recombinations (2007)
Alberto Moraglio, Riccardo Poli
Abstract. Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined in a simple geometric way by using the distance associated with...
An Analysis of Publications on Particle Swarm Optimisation Applications (2007)
Particle swarm optimisation (PSO) has been enormously successful. Within little more than a decade hundreds of papers have reported successful applications of PSO. In fact, there are so many of them,...
doi:10.1155/2008/143624 Research Article Geometric Particle Swarm Optimization (2007)
Alberto Moraglio, Cecilia Di Chio, Julian Togelius, Riccardo Poli
Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimisation (PSO) and evolutionary algorithms. This...
Inbreeding properties of geometric crossover and non-geometric recombinations (2007)
Alberto Moraglio, Riccardo Poli
Abstract. Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined using the distance associated to the search space in a simple...
Modelling Group-Foraging Behaviour with Particle Swarms (2006)
Cecilia Di Chio, Riccardo Poli, Paolo Di Chio
Abstract. Despite the many features that the behaviour of the standard particle swarm algorithm shares with grouping behaviour in animals (e.g. social attraction and communication between...
Emergent Behaviour, Population-based Search and Low-pass Filtering (2006)
Riccardo Poli, Alden H. Wright, Nicholas F. Mcphee, W. B. Langdon
In recent work we have formulated a model of emergent coordinated behaviour for a population of interacting entities. The model is a modified spring mass model where the masses can perceive the...
Artificial Intelligence Www, Riccardo Poli
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)---tournament selection---we highlight a previously-unknown source of inefficiency. This leads us...
Efficient Markov chain model of machine code program execution and halting (2006)
Riccardo Poli, William B. Langdon
This paper focuses on the halting probability and the number of instructions executed by programs that halt for Turing-complete assembly-like languages and register based machines.
Artificial Intelligence 170 (2006) 953--982 (2006)
Www Elsevier Com, Riccardo Poli, William B. Langdon
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)---tournament selection---we highlight a previously-unknown source of inefficiency. This leads us...
Understanding the Biases of Generalised Recombination (2006)
Riccardo Poli, Christopher R. Stephens
In this paper we propose, model theoretically and study a general notion of recombination for fixed-length strings where homologous recombination, inversion, gene duplication, gene deletion, diploidy...
Geometric Crossover for Biological Sequences (2006)
Alberto Moraglio Riccardo, Riccardo Poli, Rolv Seehuus
This paper extends a geometric framework for interpreting crossover and mutation [4] to the case of sequences. This representation is important because it is the link between artificial evolution and...
Product Geometric Crossover (2006)
Alberto Moraglio, Riccardo Poli
Abstract. Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover...
Analogue P300-based BCI pointing device (2006)
Luca Citi, Riccardo Poli, Caterina Cinel
1 We propose a P300-based BCI mouse. The system is analogue: the pointer is controlled by directly combining the amplitudes of the outputs produced by a filter in the presence of different stimuli....
Product Geometric Crossover (2006)
Alberto Moraglio, Riccardo Poli
Abstract. Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover...
P300-based Brain Computer Interface Mouse with Genetically-optimised Analogue Control (2006)
Luca Citi, Caterina Cinel, Riccardo Poli, Francisco Sepulveda
In this paper we propose a BCI mouse based on the manipulation of P300 waves in EEG signals. The system is analogue in that at no point a binary decision is made as to whether or not a P300 was...
Geometric Crossover for Sets, Multisets and Partitions (2006)
Alberto Moraglio, Riccardo Poli
Abstract. This paper extends a geometric framework for interpreting crossover and mutation [5] to the case of sets and related representations. We show that a deep geometric duality exists between...
Riccardo Poli, Paul Marrow, Maurice Clerc, Nick Holden, William B. Langdon, Jim Kennedy, ...
In this paper we look at how the structure of the social network and the nature of the social interactions can affect the behaviour of particle swarms. To this end, we create and test a general model...
Extending the Particle Swarm Algorithm to Model Animal Foraging (2006)
Cecilia Di Chio, Riccardo Poli, Paolo Di Chio
Abstract. The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the standard...
On Turing complete T7 and MISC F--4 program fitnes landscapes (2006)
Langdon, William B., Poli, Riccardo
We use the minimal instruction set F-4 computer to define a minimal Turing complete T7 computer suitable for genetic programming (GP) and amenable to theoretical analysis. Experimental runs and...
Empirical Approach For Theory of Randomized Search Heuristics (2006)
Yossi Borenstein, Riccardo Poli
The connection of empirical and theoretical study, especially considering the ever increasing number of new RSH is, and should be quite tight. The objective of this paper is to present an empirical...
Topological crossover for the permutation representation (2005)
Alberto Moraglio, Riccardo Poli
Abstract. Topological crossovers are a class of representation-independent operators that are well-defined once a notion of distance over the solution space is defined. In this paper we explore how...
Information Landscapes and the Analysis of Search Algorithms (2005)
Borenstein Yossi, Riccardo Poli
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predict the performance of...
Extending Particle Swarm Optimisation via Genetic Programming (2005)
Riccardo Poli, William B. Langdon, Owen Holland
Particle Swarm Optimisers (PSOs) search using a set of interacting particles flying over the fitness landscape. These are typically controlled by forces that encourage each particle to fly back both...
Evolutionary Solo Pong Players (2005)
An Internet Java Applet http://www.cs.essex.ac.uk/staff/poli/ SoloPong/ allows users anywhere to play the Solo Pong game. We compare people's performance to a hand coded "Optimal"...
Backward-chaining Genetic Programming (2005)
Riccardo Poli, William B. Langdon
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. As noted in [7], even...
Evolutionary Solo Pong Players (2005)
An Internet Java Applet http://www.cs.essex.ac.uk/staff/poli/SoloPong/ allows users anywhere to play the Solo Pong game. We compare people's performance to a hand coded "Optimal"...
Evolving Problems to Learn about Particle Swarm and other Optimisers (2005)
We use evolutionary computation (EC) to automatically find problems which demonstrate the strength and weaknesses of modern search heuristics. In particular we analyse Particle Swarm Optimization...
Understanding Particle Swarm, W. B. Langdon, Riccardo Poli, Owen Holl
Genetic programming (GP) is used to create fitness landscapes which highlight strengths and weaknesses of different types of PSO and to contrast population-based swarm approaches with non stochastic...
Crossover Topologico per Permutazioni (2005)
Topological Crossover For, Alberto Moraglio, Riccardo Poli
Gli algoritmi evolutivi sono metodi generali di problemsolving, ampiamente utilizzati e con successo, che imitano in maniera semplificata l'evoluzione biologica. Sebbene tutti gli algoritmi...
Understanding Particle Swarm, W. B. Langdon, Riccardo Poli, Owen Holl
Genetic programming (GP) is used to create fitness landscapes which highlight strengths and weaknesses of different types of PSO and to contrast population-based swarm approaches with non stochastic...
CEC-2005, Edinburgh, 2-5 September 2005, Vol 1, pp81--88, IEEE press Revision : 1.20 (2005)
Evolving Problems To, W. B. Langdon, Riccardo Poli
We use evolutionary computation (EC) to automatically find problems which demonstrate the strength and weaknesses of modern search heuristics. In particular we analyse Particle Swarm Optimization...
Chapter 1 RUNNING GENETIC PROGRAMMING BACKWARDS (2005)
Runninggeneticprogrammingbackwards Riccardo Poli, Riccardo Poli, William B. Langdon
Backward chaining evolutionary algorithms (BC-EA) offer the prospect of runtime efficiency savings by reducing the number of fitness evaluations without significantly changing the course of genetic...
For The Permutation, Alberto Moraglio, Riccardo Poli
Topological crossovers are a class of representation-independent operators that are well-defined once a notion of distance over the solution space is defined. In this paper we explore how the...
Chapter 5 GENETIC PROGRAMMING (2005)
Genetic Programming John, John R. Koza, Riccardo Poli
INTRODUCTION The goal of getting computers to automatically solve problems is central to artificial intelligence, machine learning, and the broad area encompassed by what Turing called "machine...
Theoretical Analysis of Generalised Recombination (2005)
Riccardo Poli, Christopher R. Stephens
In this paper we propose, model theoretically and study a general notion of recombination for fixedlength strings where homologous crossover, inversion, gene duplication, gene deletion, diploidy and...
Backward-chaining Genetic Programming (2005)
This paper presents a backward-chaining version of GP.
Evolution of Force-Generating (2005)
Equations For Pso, Cecilia Di Chio, Riccardo Poli, William B. Langdon
We extend our previous research on evolving the physical forces which control particle swarms by considering additional ingredients, such as the velocity of the neighbourhood best and time, and...
Coarse Grained Dynamics for Generalized Recombination (2005)
Christopher R. Stephens, Riccardo Poli
An exact microscopic model for the dynamics of a genetic algorithm with generalized recombination is presented. Generalized recombination is a new form of exchange of genetic material from parents to...
Tournament selection performs tournaments by first sampling individuals uniformly at random from the population and then selecting the best of the sample for some genetic operation. This sampling...
Understanding the Biases of Generalised Recombination (2005)
Riccardo Poli, Christopher R. Stephens
In this paper we propose, model theoretically and study a general notion of recombination for fixed-length strings where homologous recombination, inversion, gene duplication, gene deletion, diploidy...
Information and Performance Landscapes (2005)
Yossi Borenstein, Riccardo Poli
When no knowledge is available on the structure of the fitness landscape, effectively the fitness function is a black box. Search in this scenario is not well understood. In this paper we introduce a...
Riccardo Poli, Christopher R. Stephens
In this paper we propose, model theoretically and study a general notion of recombination for fixed-length strings where homologous crossover, inversion, gene duplication, gene deletion, diploidy and...
Evolving problems to learn about particle swarm and other optimisers,” in CEC-2005 (2005)
We use evolutionary computation (EC) to automatically find problems which demonstrate the strength and weaknesses of modern search heuristics. In particular we analyse Particle Swarm Optimization...
An evolutionary approach to feature selection and classification (2004)
Luca Citi, Riccardo Poli, Francisco Sepulveda
We explore the use of evolutionary algorithms in the selection of features and the classification of P300 signals in BCI. As a result we have found new ways to process and combine EEG signals to...
Topological Interpretation of Crossover (2004)
Alberto Moraglio And, Alberto Moraglio, Riccardo Poli
In this paper we give a representation-independent topological definition of crossover that links it tightly to the notion of fitness landscape. Building around this definition, a...
Fitness distributions and GA hardness (2004)
Yossi Borenstein, Riccardo Poli
Considerable research effort has been spent in trying to formulate a good definition of GA-Hardness. Given an instance of a problem, the objective is to estimate the performance of a GA. Despite...
Optimization via Parameter Mapping with Genetic Programming (2004)
This paper describes a new approach for parameter optimization that uses a novel representation for the parameters to be optimized.
A Highly Efficient Function Optimization with Genetic Programming (2004)
This paper describes a new approach for function optimization that uses a novel representation for the parameters to be optimized. By using genetic programming using, the new method evolves functions...
Feature Selection and Classification in Brain Computer (2004)
Interfaces By Genetic, Luca Citi, Riccardo Poli, Caterina Cinel, Francisco Sepulveda
In this paper we explore the use of evolutionary algorithms in a wrapper-based selection of features and the classification of P300 signals in Brain Computer Interfaces. In particular we focus on a...
Reusing Code in Genetic Programming (2004)
Edgar Galvan Lopez, Riccardo Poli, Depto Ing Eléctrica, Sección De Computación, Politécnico Nacional No
In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circuits evolved by our algorithm...
Possible Sources Of Perceptualerrors In P300-Based (2004)
Speller Paradigm Caterina, Caterina Cinel, Riccardo Poli, Luca Citi
this paper we suggest that some of the perceptual phenomena observed in the latter, may also affect the former, thereby becoming potential sources of errors in of the P300-based speller paradigm. We...
An Estimation of Distribution Algorithm Based on Maximum Entropy (2004)
Alden Wright, Riccardo Poli, Chris Stephens, W. B. Langdon, Sandeep Pulavarty
Estimation of distribution algorithms (EDA) are similar to genetic algorithms except that they replace crossover and mutation with sampling from an estimated probability distribution. We develop a...
An Evolutionaryapproach To Feature Selection And (2004)
Classification In Based, Luca Citi, Riccardo Poli, Francisco Sepulveda
this paper we have explored the use of evolutionary algorithms to aid the selection of features and the classification of P300 signals in BCI. This approach has confirmed the usefulness of linear...
Constrained Molecular Dynamics as a Search (2004)
And Optimization Tool, Riccardo Poli, Christopher R. Stephens
In this paper we consider a new class of search and optimization algorithms inspired by molecular dynamics simulations in physics.
Riccardo Poli, Nicholas Freitag McPhee, Jonathan E. Rowe
Genetic Programming (GP) homologous crossovers are a group of operators, including GP onepoint crossover and GP uniform crossover, where the offspring are created preserving the position of the...
An Estimation of Distribution Algorithm Based on Maximum Entropy (2004)
Alden Wright, Riccardo Poli, Chris Stephens, W. B. Langdon, Sandeep Pulavarty
Estimation of distribution algorithms (EDA) are similar to genetic algorithms except that they replace crossover and mutation with sampling from an estimated probability distribution. We develop a...
Foundations of Genetic Algorithms 7 (2003)
Jong, Kenneth A. (ed. E Introd.), Poli, Riccardo (ed. E Introd.), Rowe, Jonathan E. (ed. E Introd.)
Foundations of Genetic Algorithms 7 (2003)
Jong, Kenneth A. (ed. E Introd.), Poli, Riccardo (ed. E Introd.), Rowe, Jonathan E. (ed. E Introd.)
0-12-208155-2
Bistability in a Gene Pool GA with Mutation (2003)
Alden H. Wright, Jonathan E. Rowe, Christopher R. Stephens, Riccardo Poli
It is possible for a GA to have two stable fixed points on a single-peak fitness landscape.
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II (2003)
Riccardo Poli, Nicholas Freitag Mcphee
This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other...
General schema theory for genetic programming with subtree-swapping crossover (2003)
Riccardo Poli, Nicholas Freitag Mcphee
This is the first part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover. The theory is based on a Cartesian node reference...
Foundations of Genetic Programming (2002)
Langdon, William B., Poli, Riccardo
Obra introductoria sobre el cómo y por qué de la programación genética, una de las formas más avanzadas del cómputo evolutivo. Se trata de una técnica que ha logrado que las computadoras...
R.: Crossover operators for A hardware implementation of GP using FPGAs and Handel-C (2002)
This paper analyses the behavior of the crossover operator in a hardware implementation of Genetic Programming using Field Programmable Gate Arrays. Three different crossover operators that limit the...
Riccardo Poli, Jonathan E. Rowe, Christopher R. Stephens, Alden H. Wright
In this paper we study, theoretically, the search biases produced by GP subtree crossover when applied to linear representations, such as those used in linear GP or in variable length GAs. The study...
Riccardo Poli, Christopher R. Stephens, Ciencias Nucleares, Alden H. Wright, Jonathan E. Rowe
In this paper we study with a schema-theoretic approach and experiments the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By...
A Fixed Point Analysis of a Gene Pool GA with Mutation (2002)
Alden Wright Computer, Alden H. Wright, Riccardo Poli, Jonathan E. Rowe
This paper was written while Alden Wright was visiting the School of Computer Science, University of Birmingham, UK. linkage equilibrium. In a linkage equilibrium population, the representation of...
Exact Results from a Coarse Grained Formulation of the Dynamics of (2002)
Christopher R. Stephens, Riccardo Poli
We consider the dynamics of variable-length Genetic Algorithms (GAs) with strings of length # # ## using a recently developed exact, coarse-grained formulation where the relevant coarse-grained...
Riccardo Poli, Christopher R. Stephens, Alden H. Wright, Jonathan E. Rowe
With a schema-theoretic approach and experiments we study the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema...
Bistability in a Gene Pool GA with Mutation (2002)
Alden Wright Computer, Alden H. Wright, Christopher R. Stephens, Jonathan E. Rowe, Riccardo Poli
It is possible for a GA to have two stable fixed points on a single-peak fitness landscape.
Cross-Modal Illusory Conjunctions Between Vision and Touch (2002)
Caterina Cinel The, Riccardo Poli, Glyn W. Humphreys
this article should be addressed to Caterina Cinel, Department of Psychology, University of Essex, Wivenhoe Park, Colchester CO4 3SQ, United Kingdom. E-mail: ccinel@essex.ac.uk Journal of...
Riccardo Poli, Jonathan E. Rowe, Christopher R. Stephens, Alden H. Wright
In this paper we study, theoretically, the search biases produced by GP subtree crossover when applied to linear representations, such as those used in linear GP or in variable length GAs. The study...
Markov chain models for GP and variable-length GAs with homologous crossover (2001)
In this paper we present a Markov chain model for GP and variable-length GAs with homologous crossover: a set of GP operators where the offspring are created preserving the position of the genetic...
Riccardo Poli, Nicholas Freitag Mcphee
Abstract. In this paper, firstly we specialise the exact GP schema theorem for one-point crossover to the case of linear structures of variable length, for example binary strings or programs with...
Exact schema theory for GP and variable-length GAs with homologous crossover (2001)
In this paper we present a new exact schema theory for genetic programming and variable-length genetic algorithms which is applicable to the general class of homologous crossovers. These are a group...
Exact schema theory for GP and variable-length GAs with homologous crossover (2001)
Riccardo Poli, Nicholas Freitag Mcphee
In this paper we present a new exact schema theory for genetic programming and variable-length genetic algorithms which is applicable to the general class of homologous crossovers. These are a group...
Riccardo Poli, Nicholas Freitag Mcphee
Abstract. In this paper, firstly we specialise the exact GP schema theorem for one-point crossover to the case of linear structures of variable length, for example binary strings or programs with...
General schema theory for genetic programming with subtree-swapping crossover (2001)
Abstract. In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operators which replace a...
Exact GP schema theory for headless chicken crossover and subtree mutation (2001)
Abstract- Here a new general GP schema theory for headless chicken crossover and subtree mutation is presented. The theory gives an exact formulation for the expected number of instances of a schema...
Exact GP schema theory for headless chicken crossover and subtree mutation (2001)
Riccardo Poli, Nicholas F. Mcphee
Abstract- Here a new general GP schema theory for headless chicken crossover and subtree mutation is presented. The theory gives an exact formulation for the expected number of instances of a schema...
General schema theory for genetic programming with subtree-swapping crossover (2001)
Abstract. In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operators which replace a...
Exact schema theory for GP and variable-length GAs with homologous crossover (2001)
Riccardo Poli, Nicholas F. Mcphee
In this paper we present a new exact schema theory for genetic programming and variablelength genetic algorithms which is applicable to the general class of homologous crossovers. These are a group...
Riccardo Poli, Nicholas F. Mcphee
In this paper, firstly we specialise the exact GP schema theorem for one-point crossover to the case of linear structures of variable length, for example binary strings or programs with arity-1...
Exact GP schema theory for headless chicken crossover and subtree mutation (2001)
Riccardo Poli, Nicholas F. Mcphee
In this paper a new general GP schema theory for headless chicken crossover and subtree mutation is presented. The theory gives an exact formulation for the expected number of instances of a schema...
General schema theory for genetic programming with subtree-swapping crossover (2001)
In this paper a new general schema theory for genetic programming is presented. Like other recent GP schema theory results (Poli 2000a, Poli 2000b), the theory gives an exact formulation (rather than...
A Fixed Point Analysis of a Gene Pool GA with Mutation (2001)
Alden H. Wright, Jonathan E. Rowe, Riccardo Poli, Christopher R. Stephens
This paper analyzes a recombination /mutation/selection genetic algorithm that uses gene pool recombination. For linear fitness functions, the infinite population model can be described by #...
Markov Chain Models for GP and Variable-length GAs with Homologous Crossover (2001)
Riccardo Poli, Jonathan E. Rowe, Nicholas Freitag McPhee
In this paper we present a Markov chain model for GP and variable-length GAs with homologous crossover: a set of GP operators where the offspring are created preserving the position of the genetic...
Abstract. Two main weaknesses of GA and GP schema theorems axe that they provide only information on the expected value of the number of instances of a given schema at the next generation E[m(H,t +...
Recursive conditional schema theorem, convergence and population sizing in genetic algorithms (2000)
In this paper we start by presenting two forms of schema theorem in which expectations are not present. These theorems allow one to predict with a known probability whether the number of instances of...
Holland's schema theorem has been criticised in (Fogel and Ghozeil 1997, Fogel and Ghozeil 1998, Fogel and Ghozeil 1999) for not being able to estimate correctly the expected proportion of a...
Introduction The recovery of the three-dimensional shape of anatomical structures is one of the most important problems in the eld of medical imaging as the quantitative, computer-based assessment of...
This paper extends recent results in the GP schema theory by formulating a proper exact schema theorem for GP with one-point crossover. This gives an exact expression for the expected number of...
Why the Schema Theorem is Correct also in the Presence of Stochastic Effects (2000)
Holland's schema theorem has been criticised in (Fogel and Ghozeil 1997, Fogel and Ghozeil 1998, Fogel and Ghozeil 1999) for not being able to estimate correctly the expected proportion of a...
Recursive Conditional Schema Theorem, Convergence and Population Sizing in Genetic Algorithms (2000)
In this paper we present two forms of schema theorem in which expectations are not present. These theorems allow one to predict with a known probability whether the number of instances of a schema at...
Exact Schema Theorem and Effective Fitness for GP with One-Point Crossover (2000)
This paper extends recent results in the GP schema theory by formulating a proper exact schema theorem for GP with one-point crossover. This gives an exact expression for the expected number of...
. Two main weaknesses of GA and GP schema theorems are that they provide only information on the expected value of the number of instances of a given schema at the next generation E[m(H; t + 1)], and...
. We propose and study new search operators and a novel node representation that can make GP fitness landscapes smoother. Together with a tree evaluation method known as sub-machine code GP and the...
Nicholas Freitag Mcphee, Riccardo Poli
In this paper we use the schema theory presented in [Poli and McPhee, 2000] to better understand the changes in size distribution when using GP with standard crossover and linear structures....
Abstract. The learning method is critical for obtaining good generalisation in neural networks with limited training data. The Standard BackPropagation (SBP) training algorithm suffers from several...
Sub-Machine-Code GP: New Results and Extensions (1999)
Abstract. Sub-machine-code GP (SMCGP) is a technique to speed up genetic programming (GP) and to extend its scope based on the idea of exploiting the internal parallelism of sequential CPUs. In...
Evolution of neural networks using weight mapping (1999)
The application of genetic programming to the evolution of neural networks has been hindered by the inadequacy of parse trees to represent oriented graphs, and by the lack of a good mechanism for...
Parallel genetic algorithm taxonomy (1999)
Mariusz Nowostawski, Riccardo Poli
Abstract—Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of computation...
Schema theorems without expectations (1999)
This paper presents two new schema theorems in which expectations are absent. The first theorem provides confidence intervals for the number of instances of a schema at the next generation. The...
We describe a recipe to solve very large parity problems using GP. The recipe includes: smooth uniform crossover (a crossover operator inspired by our theoretical research), sub-machine-code GP (a...
Mariusz Nowostawski, Riccardo Poli
Abstract---Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-slave distributed...
Late-breaking papers of EuroGP-99 (1999)
R. Poli, P. Nordin, T. Fogarty (eds.), Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
In the paper a method that moderates code growth in genetic programming is presented. The addressed problem is symbolic regression. A special mutation operator is used for the simplification of...
This paper presents new theoretical results on GA and GP schemata which allow one to predict with a known probability whether the number of instances of a given schema at the next generation is going...
Parallel Genetic Algorithm Taxonomy (1999)
Mariusz Nowostawski, Riccardo Poli
Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of computation load and...
Riccardo Poli, Jonathan Page, Wiliiam B Langdon, W. B. Langdon
We describe a recipe to solve very large parity problems using GP. The recipe includes: smooth uniform crossover (a crossover operator inspired by our theoretical research), sub-machine-code GP (a...
Sub-Machine-Code GP: New Results and Extensions (1999)
. Sub-machine-code GP (SMCGP) is a technique to speed up genetic programming (GP) and to extend its scope based on the idea of exploiting the internal parallelism of sequential CPUs. In previous work...
Amr Radi School, Amr Radi, Riccardo Poli
Neural networks with step activation function can be very efficient ways of performing non linear mappings. However, no standard learning algorithm exists for training this kind of neural networks....
Schema Theorems without Expectations (1999)
Riccardo Poli School, Riccardo Poli
This paper presents two new schema theorems in which expectations are absent. The first theorem provides confidence intervals for the number of instances of a schema at the next generation. The...
Chapter 13: Sub-machine-code Genetic Programming (1999)
Riccardo Poli, William B Langdon, William B
Introduction Genetic Programming (GP) [Koza, 1992; Koza, 1994; Banzhaf et al., 1998] is usually seen as quite demanding from the computation load and memory use point of view. So, over the years a...
Evolutionary Computation Teaching at Birmingham (1999)
Riccardo Poli School, Riccardo Poli
This paper first illustrates the motivations of the author for teaching evolutionary computation and supervising students interested in this field. Then it describes the evolutionary computation...
Two main weaknesses of GA and GP schema theorems are that they provide only information on the expected value of the number of instances of a given schema at the next generation E[m(H; t + 1)], and...
No standard learning algorithm exists for training neural networks with step activation function. In this work we use Genetic Programming (GP) to discover supervised learning algorithms which can...
Review and Taxonomy of Parallel Genetic Algorithms (1999)
Mariusz Nowostawski, Riccardo Poli
Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of computation load and...
A Highly Scalable Parallel Genetic Algorithm Based on Dynamic Deme Reorganisation (1999)
Mariusz Nowostawski, Riccardo Poli
Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-slave distributed fitness...
Why and How We Teach Evolutionary Computation at Birmingham (1999)
Riccardo Poli School, Riccardo Poli
This paper first illustrates the motivations of the author for teaching evolutionary computation and supervising students interested in this field. Then it describes the evolutionary computation...
Evolving the Architecture and Weights of Neural Networks Using a Weight Mapping Approach (1999)
The application of genetic programming to the evolution of neural networks has been hindered by the inadequacy of parse trees to represent oriented graphs, and by the lack of a good mechanism for...
Robust Mobile Robot Localisation from Sparse and Noisy Proximity Readings (1999)
The estimation of the position and orientation of a mobile robot in an environment is a dicult problem. This problem is even harder if only a small number of proximity sensors is available and the...
Robust Mobile Robot Localisation from Sparse and Noisy Proximity Readings (1999)
Most existing localisation methods for mobile robots make simplifying assumptions about the properties of the sensors. These methods therefore work well only when the inherent assumptions hold for...
Evolution of Neural Networks Using Weight Mapping (1999)
The application of genetic programming to the evolution of neural networks has been hindered by the inadequacy of parse trees to represent oriented graphs, and by the lack of a good mechanism for...
In this paper we first develop a new form of schema theorem in which expectations are not present. This theorem allows one to predict with a known probability whether the number of instances of a...
Riccardo Poli, Jonathan Page, W.B. Langdon
In this paper we describe a recipe to solve very large parity problems, using GP without automatically defined functions. The recipe includes three main ingredients: smooth uniform crossover (a...
We present a robust position tracking method for a mobile robot with seven sonar sensors. The method is based on Hough transform and probability grids. The focus of the paper is on the problem how to...
On the search properties of different crossover operators in genetic programming (1998)
In this paper we study and compare the search properties of different crossover operators in genetic programming (GP) using probabilistic models and experiments to assess the amount of genetic...
Analysis of schema variance and short term extinction likelihoods (1998)
This paper first analyses the impact of variance on schema transmission. Working from an exact derivation of the expected variance in schema transmission, it derives and analyses the signal-to-noise...
. Recurrent neural networks are particularly useful for processing time sequences and simulating dynamical systems. However, methods for building recurrent architectures have been hindered by the...
Evolving Neural Networks Using a Dual Representation with a Combined Crossover Operator (1998)
In this paper a new approach to the evolution of neural networks is presented. A linear chromosome combined with a grid-based representation of the network, and a new crossover operator, allow the...
Evolving the Topology and the Weights of Neural Networks Using a Dual Representation (1998)
. Evolutionary computation is a class of global search techniques based on the learning process of a population of potential solutions to a given problem, that has been successfully applied to a...
On the Search Properties of Different Crossover Operators in Genetic Programming (1998)
Riccardo Poli And, Riccardo Poli, W. B. Langdon
In this paper we study and compare the search properties of different crossover operators in genetic programming (GP) using probabilistic models and experiments to assess the amount of genetic...
A Review of Theoretical and Experimental Results on Schemata in Genetic Programming (1998)
Riccardo Poli And, Riccardo Poli, W. B. Langdon
. Schemata and the schema theorem, although criticised, are often used to explain why genetic algorithms (GAs) work. A considerable research effort has been produced recently to extend the GA schema...
The learning method is critical for obtaining good generalisation in neural networks with limited training data. The Standard BackPropagation (SBP ) training algorithm suffers from several problems...
Sub-machine-code GP (SMCGP) is a new technique to speed up genetic programming (GP) and to extend its scope based on the idea of exploiting the internal parallelism of sequential CPUs. In previous...
Schema Theory for Genetic Programming with One-point Crossover and Point Mutation (1998)
Riccardo Poli, William B. Langdon
We review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of...
. The learning method is critical for obtaining good generalisation in neural networks with limited training data. The Standard BackPropagation (SBP ) training algorithm suffers from several problems...
Evolving the Topology and the Weights of Neural Networks Using a Dual Representation (1998)
Jo Ao Carlos, Figueira Pujol, Riccardo Poli
. Evolutionary computation is a class of global search techniques based on the learning process of a population of potential solutions to a given problem, that has been successfully applied to a...
Neural Networks and Prior Knowledge Help the Segmentation of Medical Images (1998)
Guido Valli, Riccardo Poli, Stefano Cagnoni, Giuseppe Coppini, Prof G. Valli
This paper describes some achievements in the segmentation of medical images using artificial neural networks. We have identified three main sources of a priori information available to help perform...
In this paper we present the GP-Music System, an interactive system which allows users to evolve short musical sequences using interactive genetic programming. We also present an extension which uses...
Analysis of Schema Variance and Short Term Extinction Likelihoods (1998)
This paper first analyses the impact of variance on schema transmission. Working from an exact derivation of the expected variance in schema transmission, it derives and analyses the signal-to-noise...
Genetic Programming Can Discover Fast and General Learning Rules for Neural Networks (1998)
The Standard BackPropagation (SBP) algorithm for training neural networks suffers from several problems. In this paper, a new technique based upon Genetic Programming (GP) is proposed to overcome...
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...
Dual Network Representation Applied to the Evolution of Neural Controllers (1998)
. This paper presents a new approach to the evolution of neural networks. A linear chromosome combined with a grid-based representation of the network and a new crossover operator allow the evolution...
In this paper we present the GP-Music System, an interactive system which allows users to evolve short musical sequences using interactive genetic programming, and its extensions aimed at making the...
Continual Robot Learning with Constructive Neural Networks (1998)
. In this paper, we present an approach for combining reinforcement learning, learning by imitation, and incremental hierarchical development. We apply this approach to a realistic simulated mobile...
This paper first analyses the impact of variance on schema transmission. Working from an exact derivation of the expected variance in schema transmission, it derives and analyses the signal-to-noise...
In this paper we study and compare the search properties of different crossover operators in genetic programming (GP) using probabilistic models and experiments to assess the amount of genetic...
Sub-machine-code Genetic Programming (1998)
Riccardo Poli, William B. Langdon
CPUs are often seen as sequential, however they have a high degree of internal parallelism, typically operating on 32 or 64 bits simultaneously. This paper explores the idea of exploiting this...
Riccardo Poli, Stefano Cagnoni
In this paper we present an approach to the interactive development of programs for image enhancement with Genetic Programming (GP) based on pseudocolour transformations. In our approach the user...
Parallel Distributed Genetic Programming (PDGP) is a new form of genetic programming suitable for the development of parallel programs in which symbolic and neural processing elements can be combined...
Genetic Programming with One-Point Crossover (1997)
In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs....
A new schema theory for genetic programming with one-point crossover and point mutation (1997)
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of...
Evolution of graph-like programs with parallel distributed genetic programming (1997)
Parallel Distributed Genetic Programming (PDGP) is a new form of Genetic Programming (GP) suitable for the development of programs with a high degree of parallelism. Programs are represented in PDGP...
A New Schema Theory for Genetic Programming with One-point Crossover and Point Mutation (1997)
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of...
Genetic Programming with One-Point Crossover and Point Mutation (1997)
Riccardo Poli And, Riccardo Poli, W. B. Langdon
In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs....
Discovery of Neural Network Learning Rules Using Genetic Programming (1997)
Amr Mohamed Radi, Riccardo Poli
The development of the backpropagation learning rule has been a landmark in neural networks. It provides a computational method for training multilayer networks. Unfortunately, backpropagation...
Riccardo Poli, Stefano Cagnoni
In this paper we present an approach to the interactive development of programs for image enhancement with Genetic Programming (GP) based on pseudocolour transformations. In our approach the user...
Riccardo Poli And, Riccardo Poli, W. B. Langdon
In this paper we first review the main results in the theory of schemata in Genetic Programming (GP) and summarise a new GP schema theory which is based on a new definition of schema. Then we study...
In this paper a new approach to the evolution of neural networks is presented. A linear chromosome is combined with a graph representation of the network and with a new crossover operator which...
Recurrent neural networks are particularly useful for processing time sequences and simulating dynamical systems. However, methods for building recurrent architectures have been hindered by the fact...
Parallel Distributed Genetic Programming (PDGP) is a new form of genetic programming suitable for the development of parallel programs in which symbolic and neural processing elements can be combined...
Evolving Neural Controllers Using a Dual Network Representation (1997)
In this paper a new approach to the evolution of neural networks is presented. A linear chromosome combined with a grid-based representation of the network and a new crossover operator allow the...
Genetic Programming with One-Point Crossover (1997)
In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs....
Evolution of Cellular-automaton-based Associative Memories (1997)
Marcin Chady And, Marcin Chady, Riccardo Poli
Cellular Automata (CAs) are discrete dynamic systems composed of a large set of simple units organised into a regular one-, two- or multi-dimensional grid which update their state on the basis of...
Evolution of Cellular-automaton-based Associative Memories (1997)
Cellular Automata (CAs) are discrete dynamic systems composed of a large set of simple units organised into a regular one-, two- or multi-dimensional grid which update their state on the basis of...
In previous work we proposed a new evolutionary algorithm, GA , which incorporates features of both the classical search algorithm A and genetic algorithms. In this paper we describe the application...
Route Planning in the Space of Complete Plans (1997)
Computer Generated Forces (CGF) are software agents which simulate the behaviour of military units or equipment in a distributed interactive simulation environment. Route planning in `realistic'...
Continual Robot Learning with Constructive Neural Networks (1997)
In this paper, we present an approach for combining reinforcement learning, learning by imitation, and incremental hierarchical development. We apply this approach to a realistic simulated mobile...
Genetic Programming with One-Point Crossover and Point Mutation (1997)
In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs....
Riccardo Poli, Stefano Cagnoni
In this paper we present an approach to the interactive development of programs for image enhancement with Genetic Programming (GP) based on pseudo-colour transformations. In our approach the user...
In this paper we first review the main results in the theory of schemata in Genetic Programming (GP) and summarise a new GP schema theory which is based on a new definition of schema. Then we study...
A New Schema Theorem for Genetic Programming with One-point Crossover and Point Mutation (1997)
We review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of...
A Constructive Connectionist Approach Towards Continual Robot Learning (1997)
This work presents an approach for combining reinforcement learning, learning by imitation, and incremental hierarchical development. The approach is used in a realistic simulated mobile robot that...
Genetic programming is a methodology for program development, consisting of a special form of genetic algorithm capable of handling parse trees representing programs, that has been successfully...
A Review of Theoretical and Experimental Results on Schemata in Genetic Programming (1997)
Schemata and the schema theorem, although criticised, are often used to explain why genetic algorithms (GAs) work. A considerable research effort has been produced recently to extend the GA schema...
Abstract geometric crossover for the permutation representation (1997)
Alberto Moraglio, Riccardo Poli
Abstract crossover and abstract mutation are representation-independent operators that are well-defined once a notion of distance over the solution space is defined. They were obtained as...
SIM_AGENT: A toolkit for exploring agent designs (1996)
SIM_AGENT is a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to combine a...
SIM_AGENT: A toolkit for exploring agent designs (1996)
SIM_AGENT is a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to combine a...
SIM_AGENT: A toolkit for exploring agent designs (1996)
SIM_AGENT is a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to combine a...
The evolutionary computation cookbook: Recipes for designing new algorithms (1996)
Abstract--Evolutionary algorithms are powerful techniques for optimisation whose operation principles are inspired by natural selection and genetics. In this paper we discuss the relation between...
Genetic Programming for Image Analysis (1996)
This paper describes an approach to using GP for image analysis based on the idea that image enhancement, feature detection and image segmentation can be re-framed as filtering problems. GP can...
SIM AGENT: A toolkit for exploring agent designs (1996)
Abstract. SIM AGENT is a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to...
Parallel distributed genetic programming (1996)
This chapter describes Parallel Distributed Genetic Programming (PDGP), a form of Genetic Programming (GP) which is suitable for the development of programs with a high degree of parallelism and an...
Nuclear Regulatory Commission. Regulatory guide 3.69 (1996)
Cellular Automata (CAs) are discrete dynamic systems composed of a large set of simple units organised into a regular one-, two- or multi-dimensional grid which update their state on the basis of...
SIM AGENT: A toolkit for exploring agent designs (1996)
Aaron Sloman And, Aaron Sloman, Riccardo Poli
. SIM AGENT is a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to combine a...
Parallel Distributed Genetic Programming (1996)
Riccardo Poli School, Riccardo Poli
This chapter describes Parallel Distributed Genetic Programming (PDGP), a form of Genetic Programming (GP) which is suitable for the development of programs with a high degree of parallelism and an...
Genetic Programming for Image Analysis (1996)
This paper describes an approach to using GP for image analysis based on the idea that image enhancement, feature detection and image segmentation can be re-framed as filtering problems. GP can...
Genetic Programming for Feature Detection and Image Segmentation. (1996)
Genetic Programming is a method of program discovery/optimisation consisting of a special kind of genetic algorithm capable of operating on non-linear chromosomes (parse trees) representing programs...
An Algorithm for Real-time Vessel Enhancement and Detection (1996)
Guido Valli, Riccardo Poli, Riccardo Poli
In this paper we present a algorithm for the real-time enhancement and detection of blood vessels in medical images. The algorithm is based on a set of linear lters sensitive to vessels of dierent...
Evolutionary Computation Cookbook: Recipes for Designing New Algorithms (1996)
Riccardo Poli School, Riccardo Poli, Brian Logan
Evolutionary algorithms are powerful techniques for optimisation whose operation principles are inspired by natural selection and genetics. In this paper we discuss the relation between evolutionary...
Some Steps Towards a Form of Parallel Distributed Genetic Programming (1996)
Riccardo Poli School, Riccardo Poli
Genetic Programming is a method of program discovery consisting of a special kind of genetic algorithm capable of operating on nonlinear chromosomes (parse trees) representing programs and an...
Some Steps Towards a Form of Parallel Distributed Genetic Programming (1996)
Genetic Programming is a method of program discovery consisting of a special kind of genetic algorithm capable of operating on nonlinear chromosomes (parse trees) representing programs and an...
Genetic Programming is a method of program discovery consisting of a special kind of genetic algorithm capable of operating on parse trees representing programs and an interpreter which can run the...
SIM AGENT: A toolkit for exploring agent designs (1996)
. SIM AGENT is a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to combine a...
Evolutionary Computation Cookbook: Recipes for Designing New Algorithms (1996)
Evolutionary algorithms are powerful techniques for optimisation whose operation principles are inspired by natural selection and genetics. In this paper we discuss the relation between evolutionary...
SIM AGENT: A toolkit for exploring agent designs (1996)
. SIM AGENT is a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to combine a...
On the Relations Between Search and Evolutionary Algorithms (1996)
Evolutionary algorithms are powerful techniques for optimisation whose operation principles are inspired by natural selection and genetics. In this paper we discuss the relation between evolutionary...
Route Planning With GA* (1996)
In previous work we proposed a new evolutionary algorithm, GA*, which incorporates features of both the classical search algorithm A* and genetic algorithms. In this paper we describe the application...
Minimal Polynomial Logic: Properties and Extensions (1996)
Minimal Polynomial Logic (MPL) is a generalisation of classical propositional logic which allows truth values in the continuous interval [0; 1] and in which propositions are represented by...
SIM AGENT: A toolkit for exploring agent designs (1996)
This paper describes a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to...
Route Planning in the Space of Complete Plans (1996)
Computer Generated Forces (CGF) are software agents which simulate the behaviour of military units or equipment in a distributed interactive simulation environment. Route planning in `realistic'...
Parallel Distributed Genetic Programming (1996)
This paper describes Parallel Distributed Genetic Programming (PDGP), a new form of Genetic Programming (GP) which is suitable for the development of programs with a high degree of parallelism and an...
This paper describes the application of Parallel Distributed Genetic Programming (PDGP) to the problem of inducing programs for natural language processing. PDGP is a new form of Genetic Programming...
Genetic Programming for Image Analysis (1996)
This paper describes an approach to using GP for image analysis based on the idea that image enhancement, feature detection and image segmentation can be re-framed as image filtering problems. GP can...
A new continuous propositional logic (1995)
Riccardo Poli, Mark Ryan, Aaron Sloman
Abstract. In this paper we present Minimal Polynomial Logic (MPL), a generahsation of classical propositional logic which allows truth values in the continuous interval [0, 1] and in which...
Genetic Design of Optimum Linear and Non-linear QRS Detectors (1995)
Address Dr, Riccardo Poli, Riccardo Poli, Riccardo Poli, Stefano Cagnoni, Stefano Cagnoni, ...
This paper describes an approach to the design of optimum QRS detectors. We report on detectors including a linear or non-linear polynomial filter, which enhances and rectifies the QRS complex, and a...
A Hybrid Rule-based System with Rule-refinement Mechanisms (1995)
Riccardo Poli, Mike Brayshaw, Aaron Sloman
In this paper we present HTR, a hybrid trainable rule-based system. The key features of the system include: the heterogeneous integration of multiple control regimes, rule induction and refinement...
Simulating Agents and Their Environments (1995)
Darryl Davis, Aaron Sloman, Riccardo Poli
This paper describes a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with humanlike capabilities. Analysis of requirements showed a need to...
A Hybrid Trainable Rule-based System (1995)
In this paper we introduce a new formalism for rule specification that extends the behaviour of a traditional rule based system and allows the natural development of hybrid trainable systems. The...
A New Continuous Propositional Logic (1995)
Riccardo Poli, Mark Ryan, Aaron Sloman
In this paper we present Minimal Polynomial Logic (MPL), a generalisation of classical propositional logic which allows truth values in the continuous interval [0; 1] and in which propositions are...
Simulating Agents and Their Environments (1995)
Darryl Davis, Aaron Sloman, Riccardo Poli
This paper describes a toolkit that arose out of a project concerned with designing an architecture for an autonomous agent with human-like capabilities. Analysis of requirements showed a need to...
Neural inhabitants of MR and echo images segment cardiac structures (1993)
This paper describes a new approach to the problem of the segmentation of cardiac structures in medical imaging. The approach is based on the idea of breeding and selecting artificial creatures who...
Neural Inhabitants of MR and Echo Images Segment Cardiac Structures (1993)
This paper describes a new approach to the problem of the segmentation of cardiac structures in medical imaging. The approach is based on the idea of breeding and selecting artificial creatures who...
Riccardo Poli School, Riccardo Poli
This paper presents new theoretical results on GA and GP schemata which allow one to predict with a known probability whether the number of instances of a given schema at the next generation is going...