Tightness time for the linkage learning genetic algorithm

DOI10.1007/3-540-45105-6_97MaRDI QIDQ4436908zbMATH OpenFDO

Authors Ying-Ping Chen, David E. Goldberg

Publication date 4 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2723/27230837.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Extending the scalability of linkage learning genetic algorithms. Theory \& practice.
• A parallel genetic algorithm based on linkage identification
• Linkage learning through probabilistic expression.
• Linkage learning via probabilistic modeling in the extended compact genetic algorithm (ECGA)
• Scalability of selectorecombinative genetic algorithms for problems with tight linkage

Cited in

(2)

• Extending the scalability of linkage learning genetic algorithms. Theory \& practice.
• Scalability of selectorecombinative genetic algorithms for problems with tight linkage

This page was built for publication: Tightness time for the linkage learning genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436908)