"The performance of polyploid evolutionary algorithms is improved both by ..."

Rachel Cavill, Stephen L. Smith, Andy Terrell (2005)

> Home

Details and statistics

DOI: 10.1109/CEC.2005.1554783

access: closed

type: Conference or Workshop Paper

metadata version: 2019-01-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cec/CavillST05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/CavillST05
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. Congress on Evolutionary Computation 2005: 935-941

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.