A discipline of evolutionary programming

Theoretical Computer Science

Volumn 241, Issue 1-2, 2000, Pages 3-23

  Vitányi, Paul ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347338075     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00263-7     Document Type: Article

References (29)

1. D. Aldous, P. Diaconis, J. Spencer, J.M. Steele, Discrete Probability and Algorithms, Springer, New York, 1995.
2. D. Applegate, R. Kannan, Sampling and integration of near log-concave functions, Proc. 23rd ACM Symp. Theory Comp., 1991, pp. 156-163.
3. T.E. Davis, J.C. Principe, A simulated annealing like convergence theory for the simple genetic algorithm, Proc. 4th Int. Conf. Genet. Algorithms, Morgan Kaufmann, 1991, pp. 174-181.
4. P. Diaconis, D. Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1) (1991) 36-61.
5. P. Diaconis, S. Holmes, Three examples of Monte-Carlo Markov chains: at the interface between statistical computing, computer science, and statistical mechanics, Discrete Probability and Algorithms, Springer, New York, 1995, pp. 43-56.
6. P. Diaconis, L. Saloff-Coste, What do we know about the Metropolis algorithm? J. Comput. Syst. Sci. 57 (1998), 20-36.
7. J.A. Fill, Eigenvalue bounds on convergence to stationary for nonreversible Markov chains, with an application to the exclusion process, Ann. Appl. Probab. 1 (1) (1991) 62-87.
8. B. Goertzel, A convergence theorem for the simple GA with population size tending to infinity, Proc. 2nd IEEE Int. Conf. Evolutionary Comput., Vol. 1, Piscataway (NJ), IEEE Press, 1995.
9. D.E. Goldberg, Sizing populations for serial and parallel genetic algorithms, Proc. 3rd Int. Conf. Genet. Algorithms, Morgan Kaufmann, 1989, pp. 70-79.
10. J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Michigam, 1975.
11. M.R. Jerrum, A.J. Sinclair, Approximating the permanent, SIAM J. Comput. 18 (1989) 1149-1178.
12. M.R. Jerrum, A.J. Sinclair, The Markov chain Monte Carlo method: An approach to approximate counting and integration, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Complete Problems, PWS Publ. Co, Boston, MA, 1995 (Chapter 12).
13. K.A. de Jong, W.M. Spears, Using genetic algorithms to solve NP-complete problems, Proc. 3rd Int. Conf. Genet. Algorithms, Morgan Kaufmann, 1989, pp. 124-132.
14. K.A. de Jong, W.M. Spears, D.F. Gordon, Using Markov chains to analyze GAFOs, in: L.D. Whitley, M.D. Vose (Eds.), Proc. Foundations of Genetic Algorithms, Vol. 3, Morgan Kaufmann, 1995, pp. 115-137.
15. M. Li, P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed., Springer, New York, 1997.
16. N. Metropolis, A. Rosenblut, M. Rosenblut, A. Teller, E. Teller, Equation of state calculation by fast computing machines, J. Chem. Physics 21 (1953) 1087-1092.
17. M. Mihail, Conductance and convergence of Markov chains: a combinatorial treatment of expanders. Proc. 30th IEEE Symp. Found. Comput. Science, 1989, pp. 526-531.
18. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, MA, 1995.
19. A.E. Nix, M.D. Vose, Modeling genetic algorithms with Markov chains, Ann. Math. Artificial Intelligence 5 (1992) 79-88.
20. A. Sinclair, Algorithms for Random Generation and Counting, A Markov Chain Approach, Birkhäuser, Basel, 1992.
21. Y. Rabinovitch, A. Sinclair, A. Wigderson, Quadratic dynamical systems, Proc. 33rd IEEE Symp. Found. Comput. Science, 1992, pp. 304-313.
22. Y. Rabani, Y. Rabinovitch, A. Sinclair, A computational view of population genetics, Proc. 27th ACM Symp. Theor. Comput., 1995, pp. 83-92.
23. C.R. Reeves, Using genetic algorithms with small populations, Proc. 5th Int. Conf. Genet. Algorithms, Morgan Kaufmann, 1993, pp. 92-99.
24. G. Rudolph, Convergence Properties of Evolutionary Algorithms, Kovacs, Hamburg, 1997, pp. 253-254.
25. M. Srinivas, L.M. Patnaik, Binomially distributed populations for modelling GAs, in: S. Forrest (Ed.), Proc. 5th Int. Conf. Genetic Algorithms, Morgan Kaufmann, San Mateo, 1993, pp. 138-145.
26. J. Suzuki, A Markov chain analysis on simple genetic algorithms, IEEE Trans. Systems Man Cybernet. 25 (4) (1995) 655-659.
27. M.D. Vose, G.E. Liepins, Punctuated equilibria in genetic search, Complex Systems 5 (1) (1991) 31-44.
28. M.D. Vose, A.H. Wright, Simple genetic algorithms with linear fitness, Evolutionary Computation 2 (4) (1994) 347-368.
29. A.H. Wright, M.D. Vose, Finiteness of the fixed-point set for the simple genetic algorithm, Evolutionary Computation 3 (3) (1995) 299-309.