{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:54Z","timestamp":1750307814958,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"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":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389274","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"929-936","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Comparing global and local mutations on bit strings"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Jansen","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Klein","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , 2. edition, 2001 .]] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2. edition, 2001.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424704"},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0056845","volume-title":"A. E. Eiben, T. B\u00e4ck, M. Schoenauer, and H.-P","author":"Droste S.","year":"1998","unstructured":"S. Droste , T. Jansen , and I. Wegener . On the optimization of unimodal functions with the (1+1) evolutionary algorithm . In A. E. Eiben, T. B\u00e4ck, M. Schoenauer, and H.-P . Schwefel, editors, Proceedings of the 5th International Conference on Parallel Problem Solving From Nature (PPSN), volume 1498 of Lecture Notes in Computer Science , pages 13 -- 22 . Springer , 1998 .]] S. Droste, T. Jansen, and I. Wegener. On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In A. E. Eiben, T. B\u00e4ck, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of the 5th International Conference on Parallel Problem Solving From Nature (PPSN), volume 1498 of Lecture Notes in Computer Science, pages 13--22. Springer, 1998.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-58484-6_259","volume-title":"Y. Davidor, H.-P","author":"Horn J.","year":"1994","unstructured":"J. Horn , D. E. Goldberg , and K. Deb . Long path problems . In Y. Davidor, H.-P . Schwefel, and R. M\u00e4nner, editors, Proceedings of the Third Conference on Parallel Problem Solving from Nature (PPSN III), volume 866 of Lecture Notes in Computer Science , pages 149 -- 158 . Springer , 1994 .]] J. Horn, D. E. Goldberg, and K. Deb. Long path problems. In Y. Davidor, H.-P. Schwefel, and R. M\u00e4nner, editors, Proceedings of the Third Conference on Parallel Problem Solving from Nature (PPSN III), volume 866 of Lecture Notes in Computer Science, pages 149--158. Springer, 1994.]]"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-45356-3_9","volume-title":"M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. M. Guerv\u00f3s, and H.-P","author":"Jansen T.","year":"2000","unstructured":"T. Jansen and I. Wegener . On the choice of the mutation probability for the (1+1) ea . In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. M. Guerv\u00f3s, and H.-P . Schwefel, editors, Proceedings of the 6th International Conference on Parallel Problem Solving From Nature (PPSN), volume 1917 of Lecture Notes in Computer Science , pages 89 -- 98 . Springer , 2000 .]] T. Jansen and I. Wegener. On the choice of the mutation probability for the (1+1) ea. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. M. Guerv\u00f3s, and H.-P. Schwefel, editors, Proceedings of the 6th International Conference on Parallel Problem Solving From Nature (PPSN), volume 1917 of Lecture Notes in Computer Science, pages 89--98. Springer, 2000.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"e_1_3_2_1_10_1","volume-title":"Convergence Properties of Evolutionary Algorithms","author":"Rudolph G.","year":"1997","unstructured":"G. Rudolph . Convergence Properties of Evolutionary Algorithms . Verlag Dr . Kova\u010d, Hamburg, 1997 .]] G. Rudolph. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kova\u010d, Hamburg, 1997.]]"}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Atlanta GA USA","acronym":"GECCO08"},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389274","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:41Z","timestamp":1750255061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":10,"alternative-id":["10.1145\/1389095.1389274","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389274","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}