Investigating the Generality of Automatically Defined Functions

Created by W.Langdon from gp-bibliography.bib Revision:1.7615

@InProceedings{oreilly:1996:igADF,

• author = "Una-May O'Reilly",
• title = "Investigating the Generality of Automatically Defined Functions",
• booktitle = "Genetic Programming 1996: Proceedings of the First Annual Conference",
• editor = "John R. Koza and David E. Goldberg and David B. Fogel and Rick L. Riolo",
• year = "1996",
• month = "28--31 " # jul,
• keywords = "genetic algorithms, genetic programming, ADF",
• pages = "351--356",
• address = "Stanford University, CA, USA",
• publisher = "MIT Press",
• broken = "http://www.ai.mit.edu/people/unamay/papers/submission.ps",
• URL = "http://citeseer.ist.psu.edu/24128.html",
• size = "6 pages",
• abstract = "This paper studies how well the combination of simulated annealing and ADFs solves genetic programming (GP) style program discovery problems. On a suite composed of the even-k-parity problems for k = 3,4,5, it analyses the performance of simulated annealing with ADFs as compared to not using ADFs. In contrast to GP results on this suite, when simulated annealing is run with ADFs, as problem size increases, the advantage to using them over a standard GP program representation is marginal. When...",
• URL = "http://cognet.mit.edu/sites/default/files/books/9780262315876/pdfs/9780262315876_chap47.pdf",
• URL = "http://cognet.mit.edu/library/books/view?isbn=0262611279",
• notes = "GP-96",

}

Genetic Programming entries for Una-May O'Reilly

Citations