|
|||||||||||||||||||||||||
|
|||||||||||||||||||||||||
ABSTRACT
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that learn the repeating unit string of a given regular binary pattern string and can reproduce the learnt pattern to an arbitrary size, specified by a parameter N. We discovered that this particular problem, where the solution needs to scale with multiple size-instances of the problem, is very hard to solve without the help of domain knowledge. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Keywords:
|
|||||||||||||||||||||||||