• Corpus ID: 16299184

Toward a Better Sine Wave

@inproceedings{Streeter2006TowardAB,
  title={Toward a Better Sine Wave},
  author={Matthew J. Streeter},
  year={2006}
}
In a previous paper, we showed that genetic programming can be used to evolve approximations to functions which, given certain trade-offs between cost and error, are superior to Padé approximations, which represent a generalization of Taylor series and a powerful technique from numerical analysis. In the present paper, we present an extension to this work which allows existing Padé approximations to be used to bootstrap the evolutionary process. Specifically, we use program trees corresponding… 
No Paper Link Available

Tables from this paper

16 References

Automated Discovery of Numerical Approximation Formulae via Genetic Programming

It is found that approximations evolved by GP can be superior to Padé approximation given certain tradeoffs between approximation cost and accuracy, and that GP is able to evolve approxIMations in circumstances where the Padé approximation technique cannot be applied.

Finding an Impulse Response Function Using Genetic Programming

This paper illustrates how the recently developed genetic programming paradigm, can be used to find an approximation to the impulse response, in symbolic form, for a linear time-invariant system using only the observed response of the system to a particular known forcing function.

A Comparison of Crossover and Mutation in Genetic Programming

A large and systematic body of data on the relative effectiveness of mutation, crossover, and combinations of mutation and crossover in genetic programming (GP) is presented, the equivalent of approximately 12,000 typical runs of a GP system.

Using genetic algorithms for adaptive function approximation and mesh generation

This work has developed GA-based search procedures that perform both adaptive mesh refinement and selection of interpolations functions, both of which are necessary to achieve highly accurate function approximations while keeping the number of mesh points at a minimum.

A Comparison of Selection Schemes used in Genetic Algorithms

A mathematical analysis of tournament selection truncation selection linear and exponential ranking selection and proportional selection is carried out that allows an exact prediction of the tness values after selection.

Genetic Algorithms in Search Optimization and Machine Learning

This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.

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

    J. Koza
    Computer Science
    Complex adaptive systems
  • 1993
This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.

Genetic Programming II: Automatic Discovery of Reusable Programs.

This book presents evidence that it is possible to interpret GP with ADFs as performing either a top-down process of problem decomposition or a bottom-up process of representational change to exploit identified regularities.

Advances in Genetic Programming

This third volume of Advances in Genetic Programming highlights many of the recent technical advances in this increasingly popular field.

Advanced Mathematical Methods For Scientists And Engineers

This book gives a self-contained presentation of the methods of asymptotics and perturbation theory, methods useful for obtaining approximate analytical solutions to differential and difference…