{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:13Z","timestamp":1725566353087},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230922"},{"type":"electronic","value":"9783540302179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30217-9_17","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T12:36:06Z","timestamp":1285158966000},"page":"161-171","source":"Crossref","is-referenced-by-count":4,"title":["A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover"],"prefix":"10.1007","author":[{"given":"Richard A.","family":"Watson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"17_CR3","first-page":"51","volume-title":"Advances in Neural Information Processing Systems","author":"M. Mitchell","year":"1995","unstructured":"Mitchell, M., Holland, J.H., Forrest, S.: When will a Genetic Algorithm Outperform Hill-climbing? In: Advances in Neural Information Processing Systems, vol.\u00a06, pp. 51\u201358. Morgan Kaufmann, CA (1995)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1162\/evco.1994.2.3.279","volume":"2","author":"J.C. Culberson","year":"1995","unstructured":"Culberson, J.C.: Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions. Evolutionary Computation\u00a02, 279\u2013311 (1995)","journal-title":"Evolutionary Computation"},{"key":"17_CR5","first-page":"15","volume-title":"Parallel Problem Solving from Nature","author":"H. Muhlenbein","year":"1992","unstructured":"Muhlenbein, H.: How genetic algorithms really work: I. mutation and hillclimbing. In: Manner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol.\u00a02, pp. 15\u201325. Elsevier, Amsterdam (1992)"},{"doi-asserted-by":"crossref","unstructured":"Spears, W.M.: Crossover or Mutation? In: Whitley, D. (ed.) Foundations of Genetic Algorithms, vol.\u00a02, pp. 221\u2013237 (1992)","key":"17_CR6","DOI":"10.1016\/B978-0-08-094832-4.50020-9"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022626114466","volume":"13","author":"S. Forrest","year":"1993","unstructured":"Forrest, S., Mitchell, M.: What makes a problem hard for a Genetic Algorithm? Some anomalous results and their explanation. Machine Learning\u00a013, 285\u2013319 (1993b)","journal-title":"Machine Learning"},{"unstructured":"Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search, PhD dissertation, 95-05-048, University of New Mexico, Albuquerque (1995)","key":"17_CR8"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1162\/106365600568220","volume":"8","author":"J.H. Holland","year":"2000","unstructured":"Holland, J.H.: Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions. Evolutionary Computation\u00a08(4), 373\u2013391 (2000)","journal-title":"Evolutionary Computation"},{"key":"17_CR10","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading Massachusetts (1989)"},{"key":"17_CR11","volume-title":"Foundations of Genetic Algorithms","author":"S. Forrest","year":"1993","unstructured":"Forrest, S., Mitchell, M.: Relative Building block fitness and the Building block Hypothesis. In: Whitley, D. (ed.) Foundations of Genetic Algorithms, vol.\u00a02, Morgan Kaufmann, San Mateo (1993a)"},{"doi-asserted-by":"crossref","unstructured":"Rogers, A., Pr\u00fcgel-Bennett, A.: A Solvable Model Of A Hard Optimisation Problem. In: Kallel, L., et al. (eds.) Procs. of Theoretical Aspects of Evolutionary Computing, pp. 207\u2013221 (2001)","key":"17_CR12","DOI":"10.1007\/978-3-662-04448-3_9"},{"unstructured":"Jansen, T., Wegener, I.: Real Royal Road Functions - Where Crossover Provably is Essential. In: Spector, L., et al. (eds.) Procs. of Genetic and Evolutionary Computation Conference (Morgan Kaufmann, San Francisco, CA.), pp. 374\u2013382 (2001)","key":"17_CR13"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0056853","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R.A. Watson","year":"1998","unstructured":"Watson, R.A., Hornby, G.S., Pollack, J.B.: Modeling Building-Block Interdependency. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 97\u2013106. Springer, Heidelberg (1998)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/B978-155860734-7\/50087-1","volume-title":"Foundations of Genetic Algorithms VI","author":"R.A. Watson","year":"2001","unstructured":"Watson, R.A.: Analysis of Recombinative Algorithms on a Non-Separable Building block Problem. In: Martin, W.N., Spears, W.M. (eds.) Foundations of Genetic Algorithms VI, pp. 69\u201389. Morgan Kaufmann, San Francisco (2001)"},{"unstructured":"Watson, R.A.: Compositional Evolution: Interdisciplinary Investigations in Evolvability, Modularity, and Symbiosis. In: Natural and Artificial Evolution, PhD dissertation, Brandeis University (May 2002)","key":"17_CR16"},{"unstructured":"Mahfoud, S.: Niching Methods for Genetic Algorithms, PhD thesis, University of Illinois. (also IlliGAl Report No. 95001) (1995)","key":"17_CR17"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/genetics\/16.2.97","volume":"16","author":"S. Wright","year":"1931","unstructured":"Wright, S.: Evolution in Mendelian populations. Genetics\u00a016, 97\u2013159 (1931)","journal-title":"Genetics"},{"key":"17_CR19","doi-asserted-by":"crossref","DOI":"10.5962\/bhl.title.27468","volume-title":"The genetical theory of natural selection","author":"R.A. Fisher","year":"1930","unstructured":"Fisher, R.A.: The genetical theory of natural selection. Clarendon Press, Oxford (1930)"},{"key":"17_CR20","first-page":"2","volume-title":"Proc. Third International Conference on Genetic Algorithms","author":"G. Syswerda","year":"1989","unstructured":"Syswerda, G.: Uniform Crossover in Genetic Algorithms. In: Schaffer, J. (ed.) Proc. Third International Conference on Genetic Algorithms, pp. 2\u20139. Morgan Kaufmann Publishers, Los Altos (1989)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1162\/evco.1997.5.3.241","volume":"5","author":"P.F. Stadler","year":"1998","unstructured":"Stadler, P.F., Wagner, G.P.: Algebraic theory of recombination spaces. Evolutionary Computation\u00a05, 241\u2013275 (1998)","journal-title":"Evolutionary Computation"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/(SICI)1099-0526(199609\/10)2:1<37::AID-CPLX9>3.0.CO;2-C","volume":"2","author":"P. Gitchoff","year":"1996","unstructured":"Gitchoff, P., Wagner, G.P.: Recombination induced hypergraphs: a new approach to mutation-recombination isomorphism. Complexity\u00a02, 37\u201343 (1996)","journal-title":"Complexity"},{"doi-asserted-by":"crossref","unstructured":"Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. Bradford Books (1999)","key":"17_CR23","DOI":"10.7551\/mitpress\/6229.001.0001"},{"key":"17_CR24","first-page":"245","volume-title":"Toward a practice of autonomous systems, Proceedings of the First European Conference on Artificial Life","author":"M. Mitchell","year":"1992","unstructured":"Mitchell, M., Forrest, S., Holland, J.H.: The royal road for genetic algorithms: Fitness landscapes and GA performance. In: Toward a practice of autonomous systems, Proceedings of the First European Conference on Artificial Life, pp. 245\u2013254. Bradford Books, Cambridge (1992)"},{"key":"17_CR25","first-page":"93","volume-title":"Foundations of Genetic Algorithms","author":"K. Deb","year":"1992","unstructured":"Deb, K., Goldberg, D.E.: Analyzing Deception in Trap Functions. In: Whitley, D. (ed.) Foundations of Genetic Algorithms, vol.\u00a02, pp. 93\u2013108. Morgan Kaufmann, San Mateo (1992a)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN VIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30217-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T12:40:29Z","timestamp":1685796029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30217-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230922","9783540302179"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30217-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}