External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Irreducible complexity in a genetic algorithm

Lee K. Graham, Franz Oppacher, Steffen Christensen. Irreducible complexity in a genetic algorithm. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore. pages 3692-3697, IEEE, 2007. [doi]

Abstract

Abstract is missing.

runs on