论文信息 - Cracking and co-evolving randomizers - 字舞流文

Cracking and co-evolving randomizers

Cracking and Co-evolving Randomizers Jan Jannink Stanford University Computer Science Dept. Stanford, CA 94305 e-mail: jan@cs.stanford.edu

Jan Jannink | J. Jannink

[1] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[2] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .

[3] F. James. A Review of Pseudorandom Number Generators , 1990 .

[4] W. Daniel Hillis,et al. Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .

[5] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[6] Pierre L'Ecuyer,et al. Random numbers for simulation , 1990, CACM.

[7] Pierre L'Ecuyer,et al. Efficient and portable combined random number generators , 1988, CACM.

[8] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[9] Peter J. Angeline,et al. Competitive Environments Evolve Better Solutions for Complex Tasks , 1993, ICGA.

[10] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.

[11] Astro Teller,et al. The evolution of mental models , 1994 .

[12] Oliver G. Selfridge. ADAPTIVE STRATEGIES OF LEARNING A STUDY OF TWO-PERSON ZERO-SUM COMPETITION , 1989, ICML 1989.