{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:15:29Z","timestamp":1778249729588,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650782","type":"print"},{"value":"9783540496724","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056874","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:49:17Z","timestamp":1154306957000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Further experimentations on the scalability of the GEMGA"],"prefix":"10.1007","author":[{"given":"Hillol","family":"Kargupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghamitra","family":"Bandyopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A connectionist machine for genetic hill climbing","author":"D. H. Ackley","year":"1987","unstructured":"D. H. Ackley. A connectionist machine for genetic hill climbing. Kluwer Academic, Boston, 1987."},{"key":"31_CR2","volume-title":"Technical Report CMU-CS-97-107","author":"S. Baluja","year":"1997","unstructured":"S. Baluja and S. Davies. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. Technical Report CMU-CS-97-107, Departement of Computer Science, Carnegie Mellon University, Pittsburgh, 1997."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"S. Bandyopadhyay, H. Kargupta, and G. Wang. Revisiting the GEMGA: Scalable evolutionary optimization through linkage learning. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 603\u2013608. IEEE Press, 1998.","DOI":"10.1109\/ICEC.1998.700097"},{"key":"31_CR4","volume-title":"IlliGAL Report no. 91004 and doctoral dissertation, unversity of alabama, tuscaloosa","author":"K. Deb","year":"1991","unstructured":"K. Deb. Binary and floating-point function optimization using messy genetic algorithms. IlliGAL Report no. 91004 and doctoral dissertation, unversity of alabama, tuscaloosa, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, 1991."},{"key":"31_CR5","unstructured":"D. E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimizaiton of difficult problems using fast messy genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, pages 56\u201364, 1993."},{"issue":"5","key":"31_CR6","first-page":"493","volume":"3","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):493\u2013530, 1989. (Also TCGA Report 89003).","journal-title":"Complex Systems"},{"key":"31_CR7","volume-title":"PhD thesis","author":"G. Harik","year":"1997","unstructured":"G. Harik. Learning Linkage to Efficiently Solve Problems of Bounded Difficulty Using Genetic Algorithms. PhD thesis, Department of Computer Science, University of Michigan, Ann Arbor, 1997."},{"key":"31_CR8","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"P. Indyk, R. Motwani, P. Raghavan, and S. Vempala. Locality-presering hashing in multidimensional spaces. In http:\/\/www.cs.stanford.edu\/indyk, 1997.","DOI":"10.1145\/258533.258656"},{"key":"31_CR10","unstructured":"H. Kargupta. Computational processes of evolution: The SEARCH perspective. Presented in SIAM Annual Meeting, 1996 as the winner of the 1996 SIAM Annual Best Student Paper Prize, July 1996."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"H. Kargupta. The gene expression messy genetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 814\u2013819. IEEE Press, 1996.","DOI":"10.1109\/ICEC.1996.542706"},{"key":"31_CR12","unstructured":"H. Kargupta. Gene Expression: The Missing Link Of Evolutionary Computation. In C. Poloni D. Quagliarella, J. Periaux and G. Winter, editors, Genetic Algorithms in Engineering and Computer Science., page Chapter 4. John Wiley & Sons Ltd., 1997."},{"key":"31_CR13","unstructured":"H. Kargupta, E. Riva Sanseverino, E. Johnson, and S. Agrawal. The genetic algorithms, linkage learning, and scalable data mining. 1998."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"N. Linial and O. Sasson. Non-expansive hashing. In Journal Of ACM, pages 509\u2013518, 1996.","DOI":"10.1145\/237814.237999"},{"key":"31_CR15","first-page":"178","volume-title":"Prom recombination of genes to the estimation of distributions i. binary parameters","author":"H. Muhlenbein","year":"1996","unstructured":"H. Muhlenbein and G. Paab. Prom recombination of genes to the estimation of distributions i. binary parameters. In Parallel Problem Solving from Nature \u2014 PPSN IV, pages 178\u2013187, Berlin, 1996. Springer."},{"key":"31_CR16","unstructured":"H. M\u00fchlenbein and A. O. Rodriguez. Schemata, distributions and graphical models in evolutionary optimization. Personal Communication., December 1997."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN V"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:39:02Z","timestamp":1778247542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0056874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650782","9783540496724"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0056874","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"3 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}