{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:09:04Z","timestamp":1763201344457},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650782"},{"type":"electronic","value":"9783540496724"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056853","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T04:49:17Z","timestamp":1154321357000},"page":"97-106","source":"Crossref","is-referenced-by-count":84,"title":["Modeling building-block interdependency"],"prefix":"10.1007","author":[{"given":"Richard A.","family":"Watson","sequence":"first","affiliation":[]},{"given":"Gregory S.","family":"Hornby","sequence":"additional","affiliation":[]},{"given":"Jordan B.","family":"Pollack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"10_CR1","first-page":"23","volume-title":"FOGA3","author":"L Altenberg","year":"1995","unstructured":"Altenberg, L, 1995 \u201cThe Schema Theorem and Price's Theorem\u201d, FOGA3, editors Whitley & Vose, pp 23\u201349, Morgan Kauffmann, San Francisco."},{"key":"10_CR2","volume-title":"ICGA3","author":"K Deb","year":"1989","unstructured":"Deb, K & Goldberg, DE, 1989, \u201cAn investigation of Niche and Species Formation in genetic Function Optimization\u201d, ICGA3, San Mateo, CA: Morgan Kauffman."},{"key":"10_CR3","volume-title":"IlliGAL Report No. 91009","author":"K Deb","year":"1992","unstructured":"Deb, K & Goldberg, DE, 1992, \u201cSufficient conditions for deceptive and easy binary functions\u201d, (IlliGAL Report No. 91009), University of Illinois, IL."},{"key":"10_CR4","volume-title":"Foundations of Genetic Algorithms 2","author":"S Forrest","year":"1993","unstructured":"Forrest, S & Mitchell, M, 1993 \u201cRelative Building-block fitness and the Building-block Hypothesis\u201d, in Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo, CA."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022626114466","volume":"13","author":"S Forrest","year":"1993","unstructured":"Forrest, S & Mitchell, M, 1993b \u201cWhat makes a problem hard for a Genetic Algorithm? Some anomalous results and their explanation\u201d Machine Learning 13, pp.285\u2013319.","journal-title":"Machine Learning"},{"key":"10_CR6","volume-title":"Genetic Algorithms in Search, Optimisation and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, DE, 1989 \u201cGenetic Algorithms in Search, Optimisation and Machine Learning\u201d, Reading Massachusetts, Addison-Wesley."},{"key":"10_CR7","volume-title":"Foundations of Genetic Algorithms 3","author":"DE Goldberg","year":"1994","unstructured":"Goldberg, DE, & Horn, J, 1994 \u201cGenetic Algorithm Difficulty and the Modality of Fitness Landscapes\u201d, in Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA."},{"key":"10_CR8","volume-title":"IlliGAL Report No. 93004","author":"DE Goldberg","year":"1993","unstructured":"Goldberg, DE, Deb, K, Kargupta, H, & Harik, G, 1993 \u201cRapid, Accurate Optimization of Difficult Problems Using Fast Messy GAs\u201d, IlliGAL Report No. 93004, U. of Illinois, IL."},{"key":"10_CR9","first-page":"493","volume":"3","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, DE, Deb, K, & Korb, B, 1989 \u201cMessy Genetic Algorithms: Motivation, Analysis and first results\u201d, Complex Systems, 3, 493\u2013530.","journal-title":"Complex Systems"},{"key":"10_CR10","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, JH, 1975 \u201cAdaptation in Natural and Artificial Systems\u201d, Ann Arbor, MI: The University of Michigan Press."},{"key":"10_CR11","unstructured":"Holland, JH, 1993 \u201cRoyal Road Functions\u201d, Internet Genetic Algorithms Digest v7n22."},{"key":"10_CR12","first-page":"62","volume-title":"PhD dissertation, 95-05-048","author":"T Jones","year":"1995","unstructured":"Jones, T, 1995, Evolutionary Algorithms, Fitness Landscapes and Search, PhD dissertation, 95-05-048, University of New Mexico, Albuquerque. pp. 62\u201365."},{"key":"10_CR13","unstructured":"Jones, T, & Forrest, S, 1995 \u201cFitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms\u201d ICGA 6, Morgan & Kauffman."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Kauffman, SA, 1993 \u201cThe Origins of Order\u201d, Oxford University Press.","DOI":"10.1093\/oso\/9780195079517.001.0001"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"1992","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1992","unstructured":"Michalewicz, Z, 1992, \u201cGenetic Algorithms + Data Structures = Evolution Programs\u201d Springer-Verlag, New York, 1992."},{"key":"10_CR16","volume-title":"Advances in NIPS 6","author":"M Mitchell","year":"1995","unstructured":"Mitchell, M, Holland, JH, & Forrest, S, 1995 \u201cWhen will a Genetic Algorithm Outperform Hill-climbing?\u201d to appear in Advances in NIPS 6, Mogan Kaufmann, San Mateo, CA."},{"key":"10_CR17","volume-title":"The royal road for genetic algorithms: Fitness landscapes and GA performance","author":"M Mitchell","year":"1992","unstructured":"Mitchell, M, Forrest, S, & Holland, JH, 1992 \u201cThe royal road for genetic algorithms: Fitness landscapes and GA performance\u201d, Procs. of first ECAL, Camb., MA. MIT Press."},{"key":"10_CR18","volume-title":"The Sciences of the Artificial","author":"HA Simon","year":"1969","unstructured":"Simon, HA, 1969 \u201cThe Sciences of the Artificial\u201d Cambridge, MA. MIT Press."},{"issue":"2","key":"10_CR19","doi-asserted-by":"crossref","first-page":"l27","DOI":"10.1162\/evco.1993.1.2.127","volume":"1","author":"RE Smith","year":"1993","unstructured":"Smith, RE, Forrest, S, & Perelson, A, 1993 \u201cSearching for Diverse, Cooperative Populations with Genetic Algorithms\u201d, Evolutionary Computation 1(2), ppl27\u2013149.","journal-title":"Evolutionary Computation"},{"key":"10_CR20","first-page":"239","volume-title":"ICGA-6","author":"D Whitley","year":"1995","unstructured":"Whitley, D, Mathias, K, Rana, S & Dzubera, J, 1995 \u201cBuilding Better Test Functions\u201d, ICGA-6, editor Eshelman, pp239\u2013246, Morgan Kauffmann, San Francisco."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02430367","volume":"1","author":"D Whitley","year":"1995","unstructured":"Whitley, D, Beveridge, R, Graves, C, & Mathias, K, 1995b \u201cTest Driving Three 1995 Genetic Algorithms: New Test Functions and Geometric Matching\u201d, Heuristics, 1:77\u2013104.","journal-title":"Heuristics"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T19:53:22Z","timestamp":1707162802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650782","9783540496724"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0056853","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}