{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:58Z","timestamp":1725494458733},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405238"},{"type":"electronic","value":"9783540376194"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-37619-4_29","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T23:51:13Z","timestamp":1194393073000},"page":"285-293","source":"Crossref","is-referenced-by-count":6,"title":["Theory of Coevolutionary Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Lothar M.","family":"Schmitt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1111\/j.1467-9574.1989.tb01245.x","volume":"43","author":"E.H.L. Aarts","year":"1989","unstructured":"E.H.L. Aarts, P.J.M. van Laarhoven. Simulated Annealing: An Introduction. Statist. Neerlandica 43 (1989) 31\u201352","journal-title":"Statist. Neerlandica"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0304-3975(02)00137-8","volume":"287","author":"H.-G. Beyer","year":"2002","unstructured":"H.-G. Beyer, et al.. How to analyse evolutionary algorithms, Theoret. Comput. Sci. 287 (2002) 101\u2013130","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR3","volume-title":"Proc. of FOGA VII","author":"A. Bucci","year":"2003","unstructured":"A. Bucci, J.B. Pollack: A Mathematical Framework for the Study of Coevolution. In: C. Cotta, et al. (chairs). Proc. of FOGA VII. Morgan Kaufmann, San Francisco, CA, USA (2003)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1162\/evco.1993.1.3.269","volume":"1","author":"T.E. Davis","year":"1993","unstructured":"T.E. Davis, J.C. Principe: A Markov Chain Framework for the Simple Genetic Algorithm. Evol. Comput. 1 (1993) 269\u2013288","journal-title":"Evol. Comput."},{"key":"29_CR5","series-title":"Max Planck Inst. for Comput. Sci. Conf. Cent.","volume-title":"Seminar \u201cTheory of Evolutionary Computation 2002\u201d","author":"K. Jong De","year":"2002","unstructured":"K. De Jong: Lecture on Coevolution. In: H.-G. Beyer, et al. (chairs). Seminar \u201cTheory of Evolutionary Computation 2002\u201d, Max Planck Inst. for Comput. Sci. Conf. Cent., Schlo\u00df Dagstuhl, Saarland, Germany (2002)"},{"key":"29_CR6","volume-title":"Genetic Algorithms, in Search, Optimization & Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg: Genetic Algorithms, in Search, Optimization & Machine Learning. Addison-Wesley, Boston, MA, USA (1989)"},{"key":"29_CR7","volume-title":"Markov Chains: Theory and Applications","author":"D.L. Isaacson","year":"1961","unstructured":"D.L. Isaacson, R.W. Madsen. Markov Chains: Theory and Applications Prentice-Hall, Upper Saddle River, NJ, USA (1961)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01530781","volume":"5","author":"A.E. Nix","year":"1992","unstructured":"A.E. Nix, M.D. Vose: Modeling Genetic Algorithms with Markov Chains. Ann. Math. Artif. Intell. 5 (1992) 79\u201388","journal-title":"Ann. Math. Artif. Intell."},{"key":"29_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65970-6","volume-title":"Banach Lattices and Positive Operators","author":"H.H. Schaefer","year":"1974","unstructured":"H.H. Schaefer. Banach Lattices and Positive Operators. Springer Verlag, Berlin, Berlin, Germany (1974)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0304-3975(98)00004-8","volume":"200","author":"L.M. Schmitt","year":"1998","unstructured":"L.M. Schmitt, et al.. Linear Analysis of Genetic Algorithms. Theoret. Comput. Sci. 200 (1998) 101\u2013134","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR11","first-page":"147","volume-title":"Lect. on Math. in the Life Sci.","author":"L.M. Schmitt","year":"1999","unstructured":"L.M. Schmitt, C.L. Nehaniv: The Linear Geometry of Genetic Operators with Applications to the Analysis of Genetic Drift and Genetic Algorithms using Tournament Selection. Lect. on Math. in the Life Sci. 26, AMS, Providence, RI, USA (1999) 147\u2013166"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00406-0","volume":"259","author":"L.M. Schmitt","year":"2001","unstructured":"L.M. Schmitt. Theory of Genetic Algorithms. Theoret. Comput. Sci. 259 (2001) 1\u201361","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR13","unstructured":"L.M. Schmitt: Theory of Genetic Algorithms II. \u2014Convergence to optima for arbitrary fitness function\u2014. Tech. Rep. 2002-2-002, Aizu Univ. (2002). To app. in Theoret. Comput. Sci."},{"key":"29_CR14","series-title":"Kluwer Ser. in Evol. Comput.","volume-title":"Computing Horizons: The Hilbert Challenge Essays on the Frontiers of Evolutionary Computation","author":"L.M. Schmitt","year":"2003","unstructured":"L.M. Schmitt: Asymptotic Convergence of Scaled Genetic Algorithms to Global Optima \u2014 A gentle introduction to the theory. In: A. Menon (ed.), Computing Horizons: The Hilbert Challenge Essays on the Frontiers of Evolutionary Computation. (to app.). Kluwer Ser. in Evol. Comput. (D.E. Goldberg, ed.), Kluwer, Dordrecht, The Netherlands (2003)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"L.M. Schmitt: Coevolutionary Convergence to Global Optima. Tech. Rep. 2003-2-002, Aizu Univ. (2003), 1\u201312. Poster in Proc. GECCO 2003, Lect. Notes in Comput. Sci., Springer Verlag, Berlin, Berlin, Germany (2003)","DOI":"10.1007\/3-540-45105-6_44"},{"key":"29_CR16","volume-title":"Optimization with Genetic Algorithms in Multi-Species Environments","author":"L.M. Schmitt","year":"2003","unstructured":"L.M. Schmitt: Optimization with Genetic Algorithms in Multi-Species Environments. To appear: Proc. ICCIMA\u201903, Int. Conf. on Comput. Intelligence and Multimedia Appl., IEEE Press, New York, NY (2003)"},{"key":"29_CR17","first-page":"113","volume-title":"Proc. GECCO 2002","author":"K.O. Stanley","year":"2003","unstructured":"K.O. Stanley, R. Miikkulainen: Continual Coevolution Through Complexification. In: W.B. Langdon, et al. (eds.). Proc. GECCO 2002. Morgan Kaufmann, San Francisco, CA, USA (2003) 113\u2013120"},{"key":"29_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The Simple Genetic Algorithm: Foundations and Theory","author":"M.D. Vose","year":"1999","unstructured":"M.D. Vose: The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA, USA (1999)"},{"key":"29_CR19","first-page":"31","volume":"5","author":"M.D. Vose","year":"1991","unstructured":"M.D. Vose, G.E. Liepins: Punctuated Equilibria in Genetic Search. Complex Systems 5 (1991) 31\u201344","journal-title":"Complex Systems"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37619-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T16:46:31Z","timestamp":1684082791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37619-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405238","9783540376194"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-37619-4_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}