In this work a new approach, named Bayesian Automatic Programming (BAP), to inducing programs is presented. BAP integrates the power of grammar evolution and probabilistic models to evolve programs. We explore the use of BAP in two domains: a regression problem and the artificial ant problem. Its results are compared with traditional Genetic Programming (GP). The experimental results found encourage further investigation, especially to explore BAP in other domains and to improve the proposed approach to incorporating new mechanisms. Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Regolin, E. N., & Pozo, A. T. R. (2005). Bayesian Automatic Programming. In Lecture Notes in Computer Science (Vol. 3447, pp. 38–49). Springer Verlag. https://doi.org/10.1007/978-3-540-31989-4_4
Mendeley helps you to discover research relevant for your work.