Improving evolvability of genetic parallel programming using dynamic sample weighting

DOI10.1007/3-540-45110-2_72MaRDI QIDQ4449798zbMATH OpenFDO

Authors Sin Man Cheang, Kin-Hong Lee, Kwong-Sak Leung

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/27241802.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Parallel programs are more evolvable than sequential programs
• Data classification using genetic parallel programming
• scientific article; zbMATH DE number 2086473
• Efficient parallel genetic algorithms: Theory and practice
• Methods for evolving robust programs

Cited in

(2)

• Parallel programs are more evolvable than sequential programs
• A parallel evolutionary algorithm to optimize dynamic data types in embedded systems

This page was built for publication: Improving evolvability of genetic parallel programming using dynamic sample weighting

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