Theoretical Investigations of Evolutionary Algorithms at NICAL

摘要：

In spite of many successes of Evolutionary Algorithms (Eas)in practice, the theoretical investigation of evolutionary computation has lagged behind. During the past years, the Nature Inspired Computation and Applications Laboratory of USTC has carried out intensive investigations on one of the most important theoretical issues, the time complexity of Eas. This paper summarizes the most recent advances of our investigation.

关键词： Evolutionary Algorithms Theoretical Investigations Time Complexity

作者: Tianshi Chen Ke Tang Xin Yao

作者单位: Nature Inspired Computation and Applications Laboratory (NICAL),Department of Computer Science and T Nature Inspired Computation and Applications Laboratory (NICAL),Department of Computer Science and T

会议类型: 国际会议

会议名称: The Inaugural Symposium on Parallel Algorithms, Architectures and Programming(并行算法、结构和编程国际研讨会)

会议地点: 广州

会议语种:英文

页码: 113-123

在线出版日期: 2008-09-16（万方平台首次上网日期，不代表论文的发表时间）