%0 Conference Paper %1 langdon:1999:fairx2p %A Langdon, W. B. %B Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'99) %C Kasteel Vaeshartelt, Maastricht, Holland %D 1999 %E Postma, Eric %E Gyssen, Marc %K algorithms, binary bloat depth evolution genetic growth, initialisation, length linear of programming, reduction, search shape, spaces sub-quadratic tree uniform %P 255--256 %T Size Fair Tree Crossovers %U http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/fairxo_bnaic99.ps.gz %X Size fair crossover genetic operator for tree based genetic programming is described and tested. It produces considerably reduced increases in program size and no detrimental effect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to sub-quadratic bloat in length.

@inproceedings{langdon:1999:fairx2p, abstract = {Size fair crossover genetic operator for tree based genetic programming is described and tested. It produces considerably reduced increases in program size and no detrimental effect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to sub-quadratic bloat in length.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Kasteel Vaeshartelt, Maastricht, Holland}, author = {Langdon, W. B.}, biburl = {https://www.bibsonomy.org/bibtex/2e40c00052a069f050e58bac7a60b226e/brazovayeye}, booktitle = {Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'99)}, editor = {Postma, Eric and Gyssen, Marc}, interhash = {c8e4c779b5848bdfa022e2a7fd3999ca}, intrahash = {e40c00052a069f050e58bac7a60b226e}, keywords = {algorithms, binary bloat depth evolution genetic growth, initialisation, length linear of programming, reduction, search shape, spaces sub-quadratic tree uniform}, month = {3-4 November}, notes = {Resumission of \cite{langdon:1999:fairxo} http://www.cs.unimaas.nl/~bnvki/}, organisation = {BNVKI, Dutch and the Belgian AI Association}, pages = {255--256}, size = {2 pages}, timestamp = {2008-06-19T17:44:55.000+0200}, title = {Size Fair Tree Crossovers}, url = {http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/fairxo_bnaic99.ps.gz}, year = 1999 }