- author = "Alexandros Agapitos and Simon M. Lucas",
- title = "Evolving Efficient Recursive Sorting Algorithms",
- booktitle = "Proceedings of the 2006 IEEE Congress on Evolutionary Computation",
- year = "2006",
- editor = "Gary G. Yen and Lipo Wang and Piero Bonissone and Simon M. Lucas",
- pages = "9227--9234",
- address = "Vancouver",
- month = "16-21 " # jul,
- publisher = "IEEE Press",
- keywords = "genetic algorithms, genetic programming, computational complexity, evolutionary computation, object-oriented languages, object-oriented programming, OOGP, evolutionary process, fitness function, language primitives, object oriented genetic programming, recursive sorting algorithms, time complexity",
- ISBN = "0-7803-9487-9",
-
URL = "
http://privatewww.essex.ac.uk/~aagapi/papers/AgapitosLucasEvolvingSort.pdf",
-
DOI = "
doi:10.1109/CEC.2006.1688643",
- size = "8 pages",
- abstract = "Object Oriented Genetic Programming (OOGP) is applied to the task of evolving general recursive sorting algorithms. We studied the effects of language primitives and fitness functions on the success of the evolutionary process. For language primitives, these were the methods of a simple list processing package. Five different fitness functions based on sequence disorder were evaluated. The time complexity of the successfully evolved algorithms was measured experimentally in terms of the number of method invocations made, and for the best evolved individuals this was best approximated as O(n log(n)). This is the first time that sorting algorithms of this complexity have been evolved.",
-
notes = "WCCI 2006 - A joint meeting of the IEEE, the EPS, and
the IEE.
Best in session. IEEE Xplore gives pages as 2677--2684",
