A mixed evolutionary-statistical analysis of an algorithm's complexity

  • Cotta C
  • Moscato P
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 5

    Citations

    Citations of this article.

Abstract

A combination of evolutionary algorithms and statistical techniques is used to analyze the worst-case computational complexity of two sorting algorithms. It is shown that excellent bounds for these algorithms can be obtained using this approach; this fact raises interesting prospects for applying the approach to other problems and algorithms. Several guidelines for extending this work are included. © 2002 Elsevier Science Ltd. All rights reserved.

Author-supplied keywords

  • Algorithms
  • Computational complexity
  • Evolutionary computing
  • Statistical analysis

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free