Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

TSMC
2002

favoriteEmaildiscussreport

125views more TSMC 2002»

Dynamic page based crossover in linear genetic programming

13 years 10 months ago

Dynamic page based crossover in linear genetic programming

Download web.cs.dal.ca

Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructions, constant for all individuals in the population. Pairwise crossover results in the swapping of single pages, thus individuals are of a fixed number of instructions. Head-to-head comparison with Tree structured GP and block-based Linear GP indicates that the page-based approach evolves succinct solutions without penalizing generalization ability.

Malcolm I. Heywood, A. Nur Zincir-Heywood

Real-time Traffic

Fixed Number | Linear Genetic Programming | Pages | TSMC 2002 |

claim paper

Related Content

» Register Based Genetic Programming on FPGA Computing Platforms

» Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics

» Why evolution is not a good paradigm for program induction a critique of genetic programmi...

» Repeated Patterns in Tree Genetic Programming

» SINERGY A Linear Planner Based on Genetic Programming

» Chemical Genetic Programming Coevolution Between Genotypic Strings and Phenotypic Trees

» Memory with memory soft assignment in genetic programming

» A dynamic code placement technique for scratchpad memory using postpass optimization

» Reverse logistics network design with stochastic lead times

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TSMC
Authors	Malcolm I. Heywood, A. Nur Zincir-Heywood

Comments (0)