Average Time Complexity of Estimation of Distribution Algorithms
暂无分享,去创建一个
[1] David E. Goldberg,et al. Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..
[2] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[3] Pedro Larrañaga,et al. Combinatonal Optimization by Learning and Simulation of Bayesian Networks , 2000, UAI.
[4] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[5] Reinhard Männer,et al. Parallel Problem Solving from Nature — PPSN III , 1994, Lecture Notes in Computer Science.
[6] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[7] Heinz Mühlenbein,et al. Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning , 2002, Int. J. Approx. Reason..
[8] S. Baluja,et al. Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .
[9] Kalyanmoy Deb,et al. Long Path Problems , 1994, PPSN.