Author:
Amaya Jhon Edgar,Cotta Carlos,Fernández-Leiva Antonio J.
Publisher
Springer Science and Business Media LLC
Subject
Control and Optimization,General Computer Science
Reference69 articles.
1. Hart WE, Belew RK (1991) Optimizing an arbitrary function is hard for the genetic algorithm. In: Belew RK, Booker LB (eds) 4th international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 190–195
2. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1): 67–82
3. Bonissone P, Subbu R, Eklund N, Kiehl T (2006) Evolutionary algorithms + domain knowledge = real-world evolutionary computation. IEEE Trans Evol Comput 10(3): 256–280
4. Hart W, Krasnogor N, Smith J (2005) Recent advances in memetic algorithms. Studies in fuzziness and soft computing, vol 166. Springer, Berlin
5. Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans Evol Comput 9(5): 474–488
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献