{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:28:40Z","timestamp":1761596920501,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068218","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"1287-1294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Information landscapes and the analysis of search algorithms"],"prefix":"10.1145","author":[{"given":"Borenstein","family":"Yossi","sequence":"first","affiliation":[{"name":"University of Essex"}]},{"given":"Riccardo","family":"Poli","sequence":"additional","affiliation":[{"name":"University of Essex"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"e_1_3_2_1_2_1","volume-title":"Foundations of Genetic Algorithms 2. Morgan Kaufmann","author":"Forrest S.","year":"1992","unstructured":"S. Forrest and M. Mitchell . Relative Building Block Fitness and the Building Block Hypothesis . In D. Whitley (ed.) Foundations of Genetic Algorithms 2. Morgan Kaufmann , San Mateo , CA , 1992 .]] S.Forrest and M.Mitchell. Relative Building Block Fitness and the Building Block Hypothesis. In D. Whitley (ed.) Foundations of Genetic Algorithms 2. Morgan Kaufmann, San Mateo, CA, 1992.]]"},{"issue":"1","key":"e_1_3_2_1_3_1","first-page":"1099","article-title":"Analysis of the (1+1) EA for a Noisy OneMax","volume":"1088","author":"Droste Stefan","year":"2004","unstructured":"Stefan Droste : Analysis of the (1+1) EA for a Noisy OneMax . GECCO ( 1 ) 1088 -- 1099 , 2004 .]] Stefan Droste: Analysis of the (1+1) EA for a Noisy OneMax. GECCO (1) 1088--1099, 2004.]]","journal-title":"GECCO"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1006236"},{"key":"e_1_3_2_1_5_1","volume-title":"Optimization and Machine Learning. Morgan Kaufmann","author":"Goldberg D. E.","year":"1989","unstructured":"D. E. Goldberg . Genetic Algorithms in Search , Optimization and Machine Learning. Morgan Kaufmann , 1989 .]] D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Morgan Kaufmann, 1989.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_7_1","volume-title":"PPSN 2000:  89--98","author":"Jansen Thomas","year":"2002","unstructured":"Thomas Jansen , Ingo Wegener : On the Choice of the Mutation Probability for the (1+1) EA . PPSN 2000: 89--98 , 2002 .]] Thomas Jansen, Ingo Wegener: On the Choice of the Mutation Probability for the (1+1) EA. PPSN 2000: 89--98, 2002.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"J.Alander (Ed.) Proceedings of the 2nd Nordic Workshop on Genetic Algorithms and their Applications","author":"H\u00f6hn C.","year":"1996","unstructured":"C. H\u00f6hn and C.R. Reeves ( 1996 ) The crossover landscape for the onemax problem . In J.Alander (Ed.) Proceedings of the 2nd Nordic Workshop on Genetic Algorithms and their Applications , University of Vaasa Press, Vaasa, Finland, pages 27--43 , 1996.]] C.H\u00f6hn and C.R.Reeves (1996) The crossover landscape for the onemax problem. In J.Alander (Ed.) Proceedings of the 2nd Nordic Workshop on Genetic Algorithms and their Applications, University of Vaasa Press, Vaasa, Finland, pages 27--43, 1996.]]"},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-58484-6_253","volume-title":"PPSN III","author":"Asoh H.","year":"1994","unstructured":"H. Asoh and H. Muehlenbein . On the mean convergence time of evolutionary algorithms without selection and mutation . In PPSN III , volume 866 of Lecture Notes in Computer Science , pages 88 -- 97 . Springer-Verlag , 1994 .]] H. Asoh and H. Muehlenbein. On the mean convergence time of evolutionary algorithms without selection and mutation. In PPSN III, volume 866 of Lecture Notes in Computer Science, pages 88--97. Springer-Verlag, 1994.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"The Simple Genetic Algorithm","author":"D.","year":"1999","unstructured":"Vose, M. D. The Simple Genetic Algorithm . MIT Press , Cambridge , 1999 ]] Vose, M.D. The Simple Genetic Algorithm. MIT Press, Cambridge, 1999]]"},{"key":"e_1_3_2_1_11_1","volume-title":"GECCO","author":"Poli Riccardo","year":"2002","unstructured":"Riccardo Poli , Christopher R. Stephens , Alden H. Wright , and Jonathan E . Rowe, \"On the Search Biases of Homologous Crossover in Linear Genetic Programming and Variable-length Genetic Algorithms \", GECCO , Morgan Kaufmann , 2002 .]] Riccardo Poli, Christopher R. Stephens, Alden H. Wright, and Jonathan E. Rowe, \"On the Search Biases of Homologous Crossover in Linear Genetic Programming and Variable-length Genetic Algorithms\", GECCO, Morgan Kaufmann, 2002.]]"},{"key":"e_1_3_2_1_12_1","volume-title":"Antonsson: Variable Length Genomes for Evolutionary Algorithms. GECCO 2000:  806","author":"Lee C.-Y.","year":"2000","unstructured":"C.-Y. Lee , E. K. Antonsson: Variable Length Genomes for Evolutionary Algorithms. GECCO 2000: 806 , 2000 .]] C.-Y. Lee, E. K. Antonsson: Variable Length Genomes for Evolutionary Algorithms. GECCO 2000: 806, 2000.]]"},{"key":"e_1_3_2_1_13_1","volume-title":"GECCO 2002:  697","author":"Sim\u00f5es Anabela","year":"2002","unstructured":"Anabela Sim\u00f5es , Ernesto Costa : Parametric Study To Enhance The Genetic Algorithm's Performance When Using Transformation . GECCO 2002: 697 , 2002 .]] Anabela Sim\u00f5es, Ernesto Costa: Parametric Study To Enhance The Genetic Algorithm's Performance When Using Transformation. GECCO 2002: 697, 2002.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88094-0","volume-title":"Representations for Genetic and Evolutionary Algorithms","author":"Rothlauf Franz","year":"2002","unstructured":"Franz Rothlauf . Representations for Genetic and Evolutionary Algorithms . Springer 2002 .]] Franz Rothlauf. Representations for Genetic and Evolutionary Algorithms. Springer 2002.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068248"},{"key":"e_1_3_2_1_16_1","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to biology, control and artificial intelligence","author":"Holland J.H.","year":"1998","unstructured":"J.H. Holland . Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to biology, control and artificial intelligence . MIT Press , 1998 .]] J.H. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to biology, control and artificial intelligence. MIT Press, 1998.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_2"}],"event":{"name":"GECCO05: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Washington DC USA","acronym":"GECCO05"},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068218","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:01Z","timestamp":1750262881000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":17,"alternative-id":["10.1145\/1068009.1068218","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068218","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}