Bridging the Gap between theory and practice

被引:0
作者
Jansen, T
Wiegand, RP
机构
[1] Univ Dortmund, FB Informat, Dortmund, Germany
[2] George Mason Univ, Dept Comp Sci, Fairfax, VA 22030 USA
来源
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN VIII | 2004年 / 3242卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
While the gap between theory and practice is slowly closing, the evolutionary computation community needs' to concentrate more heavily on the middle ground. This paper defends the position that contemporary analytical tools facilitate such a concentration. Empirical research can be improved by considering modem analytical techniques in experimental design. In addition, formal analytical extensions of empirical works are possible. We justify our position by way of a constructive example: we consider a recent empirically-based research paper and extend it using modern techniques of asymptotic analysis of run time performance of the algorithms and problems investigated in that paper. The result is a more general understanding of the performance of these algorithms for any size of input, as well as a better understanding of the underlying reasons for some of the previous results. Moreover, our example points out how important it is that empirical researchers motivate their parameter choices more clearly. We believe that providing theorists with empirical studies that are well-suited for formal analysis will help bridge the gap between theory and practice, benefitting the empiricist, the theorist, and the community at large.
引用
收藏
页码:61 / 71
页数:11
相关论文
共 17 条
[1]  
Bull L., 1997, Proceedings of the Seventh International Conference on Genetic Algorithms, P370
[2]   On the analysis of the (1+1) evolutionary algorithm [J].
Droste, S ;
Jansen, T ;
Wegener, I .
THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) :51-81
[3]   From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms [J].
He, J ;
Yao, X .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (05) :495-511
[4]   Sequential versus parallel cooperative coevolutionary (1+1) EAs [J].
Jansen, T ;
Wiegand, RP .
CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, :30-37
[5]   The analysis of evolutionary algorithms - A proof that crossover really can help [J].
Jansen, T ;
Wegener, I .
ALGORITHMICA, 2002, 34 (01) :47-66
[6]  
JANSEN T, 2002, GENETIC EVOLUTIONARY, P238
[7]  
JANSEN T, 2004, IN PRESS DISCRETE AP
[8]  
JANSEN T, 2003, LNCS, V2724, P310
[9]  
Jansen T, 2001, GEN EV COMP C, P1034
[10]  
JANSEN T, 2004, IN PRESS EVOLUTIONAR