%0 Conference Paper %1 jacob:1994:glp %A Jacob, Christian %B Parallel Problem Solving from Nature III %C Jerusalem %D 1994 %E Davidor, Yuval %E Schwefel, Hans-Paul %E Männer, Reinhard %I Springer-Verlag %K algorithms, genetic programming %P 334--343 %T Genetic L-System Programming %U http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-58484-6 %V 866 %X GLP combines simulated evolution and simulated structure formation (based on Lindenmayer systems) %@ 3-540-58484-6

@inproceedings{jacob:1994:glp, abstract = {GLP combines simulated evolution and simulated structure formation (based on Lindenmayer systems)}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Jerusalem}, author = {Jacob, Christian}, biburl = {https://www.bibsonomy.org/bibtex/2ef06da7dc3218fa0d00113c655abf586/brazovayeye}, booktitle = {Parallel Problem Solving from Nature III}, editor = {Davidor, Yuval and Schwefel, Hans-Paul and M{\"a}nner, Reinhard}, interhash = {6f9c2167953e1fb6a00fbdec1744d6f0}, intrahash = {ef06da7dc3218fa0d00113c655abf586}, isbn = {3-540-58484-6}, keywords = {algorithms, genetic programming}, month = {9-14 October}, notes = {PPSN3 L-systems difficult for human programmers to use, presents simple example where L-system is evolved using a GP. Initial population created from pool of pre-defined patterns (subtrees, building blocks?) rather than GP functions or terminals. Such patterns and genetic operators have a rank (like a fitness) which is used to bias the choice of pattern. A pattern is a gramtical rule and specifies (a number of possible) types for each of its arguments. Genetic operators include copying templates (sub trees?) into the pattern pool (or genetic library).}, pages = {334--343}, publisher = {Springer-Verlag}, publisher_address = {Berlin, Germany}, series = {LNCS}, timestamp = {2008-06-19T17:42:18.000+0200}, title = {Genetic {L}-System Programming}, url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-58484-6}, volume = 866, year = 1994 }