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

被引：9
作者：
Cotta, C
Moscato, P
机构：
[1] Univ Malaga, Dept Comp Sci, ETSI Informat 3 2 49, E-29071 Malaga, Spain
[2] Univ Estadual Campinas, Dept Engn Comp & Automacao Ind, BR-13083970 Campinas, SP, Brazil
来源：
APPLIED MATHEMATICS LETTERS | 2003年 / 16卷 / 01期
关键词：
algorithms; statistical analysis; computational complexity; evolutionary computing;
D O I：
10.1016/S0893-9659(02)00142-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：41 / 47
页数：7
相关论文
共 7 条
[1]  
Back T., 1997, Handbook of evolutionary computation
[2]   A statistical analysis of an algorithm's complexity [J].
Chakraborty, S ;
Choudhury, PP .
APPLIED MATHEMATICS LETTERS, 2000, 13 (05) :121-126
[3]  
Chambers L., 1995, PRACTICAL HDB GENETI, V1
[4]   Genetic Forma Recombination in Permutation Flowshop Problems [J].
Cotta, Carlos ;
Troya, Jose M. .
EVOLUTIONARY COMPUTATION, 1998, 6 (01) :25-44
[5]  
Manderick B., 1991, P 4 INT C GEN ALG SA, P143
[6]  
SEDGEWICK R, 1992, ALGORITHMS C PLUSPLU
[7]   A HIGH-SPEED SORTING PROCEDURE [J].
SHELL, DL .
COMMUNICATIONS OF THE ACM, 1959, 2 (07) :30-32
1