loading...
ON LEARNING kDNF^s_n BOOLEAN FORMULAS
Long Beach, Cailfornia July 12-July 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EH.2001.937967The Third NASA/DoD Workshop on Evolva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Arturo Hernandez-Aguirre, Tulane University
Bill P. Buckles, Tulane University
Carlos A. Coello Coello, CINVESTAV-IPN
Abstract: The number of samples needed to learn an instance of the representation class kDNF^s_n of Boolean formulas is predicted using some tolerance parameters by the PAC framework. When the learning machine is a simple genetic algorithm, the initial population is an issue. Using PAC-learning we derive the population size that has at least one individual at a given Hamming distance from the optimum. Then we show that the GA evolves solutions from initial populations rather far (Hamming distance) from the optimum.
Citation:
Arturo Hernandez-Aguirre, Bill P. Buckles, Carlos A. Coello Coello, "ON LEARNING kDNF^s_n BOOLEAN FORMULAS," eh, pp.0240, The Third NASA/DoD Workshop on Evolvable Hardware, 2001
Usage of this product signifies your acceptance of the Terms of Use.