Liquid State Genetic Programming

Authors:
Mihai Oltean
Affiliations:
Department of Computer Science, Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Kogălniceanu 1, Cluj-Napoca, 3400, Romania
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 6
Cited 2

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Sub-machine-code genetic programming

Advances in genetic programming
Principles in the Evolutionary Design of Digital Circuits—Part I

Genetic Programming and Evolvable Machines
Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes

Genetic Programming and Evolvable Machines
Real-time computing without stable states: a new framework for neural computation based on perturbations

Neural Computation

Basic object oriented genetic programming

IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part I
Learning time series patterns by genetic programming

ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing the inputs (the liquid) and a Genetic Programming technique used for the problem solving part. Several numerical experiments with LSGP are performed by using several benchmarking problems. Numerical experiments show that LSGP performs similarly and sometimes even better than standard Genetic Programming for the considered test problems.