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

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Cotta, C., & Moscato, P. (2003). A mixed evolutionary-statistical analysis of an algorithm’s complexity. Applied Mathematics Letters, 16(1), 41–47. https://doi.org/10.1016/S0893-9659(02)00142-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free