The performance of polyploid evolutionary algorithms is improved both by having many chromosomes and by having many copies of each chromosome on symbolic regression problems

Rachel Cavill, Stephen L. Smith, Andy Terrell. The performance of polyploid evolutionary algorithms is improved both by having many chromosomes and by having many copies of each chromosome on symbolic regression problems. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2005, 2-4 September 2005, Edinburgh, UK. pages 935-941, IEEE, 2005. [doi]

Authors

Rachel Cavill

This author has not been identified. Look up 'Rachel Cavill' in Google

Stephen L. Smith

This author has not been identified. Look up 'Stephen L. Smith' in Google

Andy Terrell

This author has not been identified. Look up 'Andy Terrell' in Google