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]

@inproceedings{GrahamOC07,
  title = {Irreducible complexity in a genetic algorithm},
  author = {Lee K. Graham and Franz Oppacher and Steffen Christensen},
  year = {2007},
  doi = {10.1109/CEC.2007.4424951},
  url = {http://dx.doi.org/10.1109/CEC.2007.4424951},
  researchr = {https://researchr.org/publication/GrahamOC07},
  cites = {0},
  citedby = {0},
  pages = {3692-3697},
  booktitle = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore},
  publisher = {IEEE},
}