Author:
Fogel David B.,Fogel Lawrence J.
Publisher
Springer Berlin Heidelberg
Reference46 articles.
1. B.K. Ambati, J. Ambati, and M.M. Mokhtar (1991) “Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the traveling salesman problem,” Biological Cybernetics, Vol. 65, pp. 31–35.
2. P.J. Angeline, G.M. Saunders and J.B. Pollack (1994) “An evolutionary algorithm that constructs recurrent neural networks,” IEEE Transactions on Neural Networks, Vol. 5, pp. 54–65.
3. W. Atmar (1994) “Notes on the simulation of evolution,” IEEE Transactions on Neural Networks, Vol. 5, pp. 130–148.
4. R. Axelrod (1987) “The evolution of strategies in the iterated prisoner's dilemma,” Genetic Algorithms and Simulated Annealing, L. Davis (ed.), Pitman, London, pp. 32–42.
5. R. Axelrod (1984) The Evolution of Cooperation, Basic Books, NY.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献