Artículos de revistas
A mixed evolutionary-statistical analysis of an algorithm's complexity
Applied Mathematics Letters. Pergamon-elsevier Science Ltd, v. 16, n. 1, n. 41, n. 47, 2003.
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. (C) 2002 Elsevier Science Ltd. All rights reserved.1614147