Distributed Hybrid Genetic programming for learning Boolean Functions

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

@Misc{oai:CiteSeerPSU:411824,

• author = "Stefan Droste and Dominic Heutelbeck and Ingo Wegener",
• title = "Distributed Hybrid Genetic programming for learning {Boolean} Functions",
• institution = "Department of Computer Science/XI, University of Dortment",
• year = "2000",
• number = "CI-90/00",
• address = "44221 Dortmund, Germany",
• month = aug,
• keywords = "genetic algorithms, genetic programming",
• URL = "https://eldorado.uni-dortmund.de/dspace/bitstream/2003/5393/1/ci90.pdf",
• URL = "http://citeseer.ist.psu.edu/411824.html",
• abstract = "When genetic programming (GP) is used to find programs with Boolean inputs and outputs, ordered binary decision diagrams (OBDDs) are often used successfully. In all known OBDD-based GP-systems the variable ordering, a crucial factor for the size of OBDDs, is preset to an optimal ordering of the known test function. Certainly this cannot be done in practical applications, where the function to learn and hence its optimal variable ordering are unknown. Here, the first GP-system is presented that evolves the variable ordering of the OBDDs and the OBDDs itself by using a distributed hybrid approach. For the experiments presented the unavoidable size increase compared to the optimal variable ordering is quite small. Hence, this approach is a big step towards learning well-generalizing Boolean functions.",
• size = "pages",

}

Genetic Programming entries for Stefan Droste Dominic Heutelbeck Ingo Wegener

Citations