Jun He, Xin Yao and Qingfu Zhang
It has been recognised in the evolutionary computation (EC) community that EC theory is lagging behind applications. However, progresses have been made in recent years on a number of theoretical topics, e.g., convergence of evolutionary algorithms (EAs), (local) convergence rate of EAs, modified schema theorems, fitness landscape analysis, etc. Some insights have been gained through such studies. Interestingly, most mainstream computer scientists regard computational time complexity as a key issue in the analysis of algorithms, while few such complexity results exist in EC. This special session aims at bringing researchers who are interested in the computational time complexity of EAs together to review the current state-of-art, exchange the latest ideas and explore future directions. The major topics of interest include, but are not limited to,
All submissions or enquiries to this special session should be sent to:
Dr. Jun He
School of Computer Science
The University of Birmingham
Edgbaston, Birmingham B15 2TT, UK
Dr. Qingfu Zhang
Department of Computer Science
University of Essex
Wivenhoe Park, Colchester CO4 3SQ, UK
Email submissions of PDF files are strongly encouraged!
Paper formatting guidelines can be found from the home page of the 2003 Congress on Evolutionary Computation.