Distributed Hybrid Genetic Programming for Learning Boolean Functions
| dc.contributor.author | Droste, Stefan | de |
| dc.contributor.author | Heutelbeck, Dominic | de |
| dc.contributor.author | Wegener, Ingo | de |
| dc.date.accessioned | 2004-12-07T08:20:28Z | |
| dc.date.available | 2004-12-07T08:20:28Z | |
| dc.date.created | 2000 | de |
| dc.date.issued | 2001-10-17 | de |
| dc.description.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. | en |
| dc.format.extent | 191777 bytes | |
| dc.format.extent | 546013 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5393 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15246 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Reihe Computational Intelligence ; 90 | de |
| dc.subject.ddc | 004 | de |
| dc.title | Distributed Hybrid Genetic Programming for Learning Boolean Functions | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |