Scalability of selectorecombinative genetic algorithms for problems with tight linkage

DOI10.1007/3-540-45110-2_8MaRDI QIDQ4449711zbMATH OpenFDO

Authors Kumara Sastry, David E. Goldberg

Publication date 11 February 2004

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/2724/27241332.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4189186
• Extending the scalability of linkage learning genetic algorithms. Theory \& practice.
• Analysis of recombinative algorithms on a non-separable building-block problem
• Tightness time for the linkage learning genetic algorithm
• Linkage learning through probabilistic expression.

Cited in

(4)

• Extending the scalability of linkage learning genetic algorithms. Theory \& practice.
• Analysis of recombinative algorithms on a non-separable building-block problem
• Tightness time for the linkage learning genetic algorithm
• scientific article; zbMATH DE number 4189186 (Why is no real title available?)

This page was built for publication: Scalability of selectorecombinative genetic algorithms for problems with tight linkage

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