An Introduction to Genetic Algorithms - Boente

More documents

Recommendations

Info

Appendix B: Other Resources Grefenstette, J. J. 1993. Deception considered harmful. In L. D. Whitley, ed., Foundations of Genetic Algorithms 2. Morgan Kaufmann. Grefenstette, J. J., and Baker, J. E. 1989. How genetic algorithms work: A critical look at implicit parallelism. In J. D. Schaffer, ed., Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann. Gruau, F. 1992. Genetic synthesis of Boolean neural networks with a cell rewriting developmental process. In L. D. Whitley and J. D. Schaffer, eds.,COGANN—92: International Workshop on Combinations of Genetic Algorithms and Neural Networks. IEEE Computer Society Press. Hancock, P. j. B. 1994. An empirical comparison of selection methods in evolutionary algorithms. In T. C. Fogarty, ed., Evolutionary Computing: AISB Workshop, Leeds, U.K., April 1994, Selected Papers. Springer−Verlag. Hanson, J. E., andCrutchfield, J. P. 1992. The attractor−basin portrait of a cellular automaton. Journal of Statistical Physics 66, no. 5/6: 1415–1462. Harp, S. A., and Samad, T. 1991. Genetic synthesis of neural network architecture. In L. D. Davis, ed., Handbook of Genetic Algorithms. Van Nostrand Reinhold Hart, W. E., andBelew, R., K. 1996. Optimization with genetic algorithm hybrids that use local search. In R. K. Belew and M. Mitchell, eds., Adaptive Individuals in Evolving Populations: Models and Algorithms. Addison−Wesley. Harvey, I. 1992. Species adaptation genetic algorithms: A basis for a continuing SAGA. In F. J. Varela and P. Bourgine, eds., Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life. MIT Press. Harvey, I. 1993. The puzzle of the persistent question marks: A case study of genetic drift. In S. Forrest, ed., Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan kaufmann. Heisler, I. L., and Curtsinger, J. W. 1990. Dynamics of sexual selection in diploid populations. Evolution 44, no. 5: 1164–1176. Hertz, J., Krogh, A., and Palmer, R. G. 1991. Introduction to the Theory of Neural Computation. Addison−Wesley. Hillis, W. D. 1990. Co−evolving parasites improve simulated evolution as an optimization procedure. Physica D 42: 228–234. 150
Appendix B: Other Resources Hillis, W. D. 1992. Co−evolvingd parasites improve simulated evolution as an optimization procedure. In C. G. Langton, C. Taylor, J. D. Farmer, and S. Rasmussen, eds., Artificial Life II. Addison−Wesley. Hinton, G. E., andNowlan, S. J. 1987. How learning can guide evolution. Complex Systems 1: 495–502. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press. (Second edition: MIT Press, 1992.) Holland, J. H. 1986. Escaping brittleness: The possibilities of general−purpose learning algorithms applied to parallel rule−based systems. In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, eds., Machine Learning II. Morgan Kaufmann. Holland, J. H. 1993. Innovation in Complex Adaptive Systems: Some Mathematical Sketches. Working Paper 93–10–062, Santa Fe Institute. Holland, J. H. 1994. Echoing emergence: Objectives, rough definitions, and speculations for ECHO−class models. In G. Cowan, D. Pines, and D. Melzner, eds., Complexity: Metaphors, Models, and Reality. Addison−Wesley. Horn, J. 1993. Finite Markov chain analysis of genetic algorithms with niching. In S. Forrest, ed., Proceedings of the Fifth International Conference on Genetic Algorithms Morgan Kaufmann. Hunter, L., Searls, D., and Shavlik, J., eds., 1993. Proceedings of the First International Conference on Intelligent Systems for Molecular Biology. AAAI Press. Janikow, C. Z., and Michalewicz, Z. 1991. An experimental comparison of binary and floating point representations in genetic algorithms. In R. K. Belew and L. B. Booker, eds., Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann. Jones, T. 1995. Crossover, macromutation, and population−based search. In L. J. Eshelman, ed., Proceedings of the Sixth International Conference on Genetic Algorithms. Morgan Kaufmann. Jones, T., and Forrest, S. 1993. An Introduction to SFI Echo. Working Paper 93−12−074, Santa Fe Institute. Kinnear, K. E. Jr., ed. 1994. Advances in Genetic Programming. MIT Press. Kirkpatrick, M. 1982. Sexual selection and the evolution of female choice. Evolution 1: 1–12. Kirkpatrick, M., and Ryan, M. 1991. The evolution of mating preferences and the paradox of the lek. Nature 350: 33–38. 151
Page 2 and 3:
An Introduction to Genetic Algorith
Page 4 and 5:
Table of Contents Chapter 4: Theore
Page 6 and 7:
Chapter 1: Genetic Algorithms: An O
Page 8 and 9:
Page 10 and 11:
1.4 SEARCH SPACES AND FITNESS LANDS
Page 12 and 13:
potential energy is a measure of ho
Page 14 and 15:
A simple method of implementing fit
Page 16 and 17:
from an initial state to a goal. Fo
Page 18 and 19:
Robert Axelrod of the University of
Page 20 and 21:
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
instances of H at time t, and let
Page 28 and 29:
What is the total payoff after 10 g
Page 30 and 31:
6. * c. d. a. b. Chapter 1: Genetic
Page 32 and 33:
As a simple example, consider a pro
Page 34 and 35:
Chapter 2: Genetic Algorithms in Pr
Page 36 and 37:
it to get one fitness case correct:
Page 38 and 39:
Evolving Cellular Automata Chapter
Page 40 and 41:
Page 42 and 43:
up most of the computation time. Ch
Page 44 and 45:
Page 46 and 47:
the prospect of using GAs to automa
Page 48 and 49:
where Ã is the standard deviation
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
the brain. In a feedforward network
Page 56 and 57:
Page 58 and 59:
Figure 2.21: An illustration of Mil
Page 60 and 61:
Page 62 and 63:
experiments with grammatical encodi
Page 64 and 65:
function of the average error of th
Page 66 and 67:
COMPUTER EXERCISES 1. 2. 3. 4. 5. 6
Page 68 and 69:
Page 70 and 71:
simulated generations, and such sim
Page 72 and 73:
environments, they can fairly quick
Page 74 and 75:
Chapter 3: Genetic Algorithms in Sc
Page 76 and 77:
Figure 3.6: A schematic illustratio
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
an initial population in which the
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
these random effects, Bedau and Pac
Page 90 and 91:
3. * 4. * the female child in the n
Page 92 and 93:
calculating the observed average fi
Page 94 and 95:
(4.1) The goal is to find n = n* th
Page 96 and 97:
competition in the d *···* parti
Page 98 and 99:
schemas with the best observed fitn
Page 100 and 101:
Steepest−ascent hill climbing (SA
Page 102 and 103:
(If the algorithm spends only 1/m o
Page 104 and 105: strings—then in principle crossov
Page 106 and 107: (4.7) Chapter 4: Theoretical Founda
Page 108 and 109: 2. 3. Calculate the fitness f(x) of
Page 110 and 111: Defining ri,j(k) and is somewhat tr
Page 112 and 113: Results of the Formalization How ca
Page 114 and 115: Chapter 4: Theoretical Foundations
Page 118 and 119: Figure 4.5: Predicted and observed
Page 120 and 121: COMPUTER EXERCISES 1. 2. 3. 4. 5. 6
Page 122 and 123: prone to rather arbitrary orderings
Page 124 and 125: Inversion works by choosing two poi
Page 128 and 129: The one hitch is that, as was seen
Page 130 and 131: used in the work of Tanese (1989),
Page 132 and 133: Two individuals are chosen at rando
Page 136 and 137: strategies community, in which para
Page 138 and 139: * 10. * 11. * 12. * Chapter 4: Theo
Page 140 and 141: Chapter 6: Conclusions and Future D
Page 142 and 143: Chapter 6: Conclusions and Future D
Page 144 and 145: Appendix A: Selected General Refere
Page 146 and 147: Evolution Artificielle Foundations
Page 148 and 149: Kaufmann. Appendix B: Other Resourc
Page 150 and 151: Morgan Kaufmann. Appendix B: Other
Page 152 and 153: Appendix B: Other Resources Forrest
Page 156 and 157: Kirkpatrick, S., Gelatt, C.D., Jr.,
Page 158 and 159: Appendix B: Other Resources Mitchel
Page 160 and 161: Appendix B: Other Resources Roughga
Page 162: Appendix B: Other Resources Vose, M
show all

An Introduction to Genetic Algorithms - Boente

Create successful ePaper yourself

Delete template?

Save as template?