{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:03:25Z","timestamp":1750831405304,"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.1389249","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"771-778","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Precision, local search and unimodal functions"],"prefix":"10.1145","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[{"name":"Technische Universitat Ilmenau, Ilmenau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan E.","family":"Rowe","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, United Kngdm"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Wegener","sequence":"additional","affiliation":[{"name":"Technische Universitat Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}],"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":"Proc. 25th International Symposium on Theoretical Aspects of Computer Science","author":"Dietzfelbinger M.","year":"2008","unstructured":"M. Dietzfelbinger , J. E. Rowe , I. Wegener , and P. Woelfel . Tight bounds for blind search on the integers . In Proc. 25th International Symposium on Theoretical Aspects of Computer Science , 2008 . M. Dietzfelbinger, J. E. Rowe, I. Wegener, and P. Woelfel. Tight bounds for blind search on the integers. In Proc. 25th International Symposium on Theoretical Aspects of Computer Science, 2008."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668928"},{"key":"e_1_3_2_1_3_1","first-page":"1005","volume-title":"GECCO 2004","author":"Hidovi\u0107 D.","year":"2004","unstructured":"D. Hidovi\u0107 and J. E. Rowe . Validating a model of colon colouration using an evolution strategy with adaptive approximations. In K. Deb, editor , GECCO 2004 , LNCS 3102, pages 1005 -- 1016 . Springer-Verlag , 2004 . D. Hidovi\u0107 and J. E. Rowe. Validating a model of colon colouration using an evolution strategy with adaptive approximations. In K. Deb, editor, GECCO 2004, LNCS 3102, pages 1005--1016. Springer-Verlag, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.042"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1953-0055639-3"},{"key":"e_1_3_2_1_6_1","first-page":"725","volume-title":"GECCO 2004","author":"Rowe J. E.","year":"2004","unstructured":"J. E. Rowe and D. Hidovi\u0107 . An evolution strategy using a continuous version of the gray-code neighbourhood distribution. In K. Deb, editor , GECCO 2004 , LNCS 3102, pages 725 -- 736 . Springer-Verlag , 2004 . J. E. Rowe and D. Hidovi\u0107. An evolution strategy using a continuous version of the gray-code neighbourhood distribution. In K. Deb, editor, GECCO 2004, LNCS 3102, pages 725--736. Springer-Verlag, 2004."},{"key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","volume-title":"Complexity Theory: Exploring the Limits of Efficient Algorithms","author":"Wegener I.","year":"2005","unstructured":"I. Wegener . Complexity Theory: Exploring the Limits of Efficient Algorithms . Springer-Verlag , 2005 . I. Wegener. Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer-Verlag, 2005."},{"key":"e_1_3_2_1_9_1","first-page":"726","volume-title":"GECCO 1999","author":"Whitley L. D.","year":"1999","unstructured":"L. D. Whitley . A free lunch proof for Gray versus binary encodings. In W. Banzhaf et al, editor , GECCO 1999 , pages 726 -- 733 . Morgan Kaufmann , 1999 . L. D. Whitley. A free lunch proof for Gray versus binary encodings. In W. Banzhaf et al, editor, GECCO 1999, pages 726--733. Morgan Kaufmann, 1999."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513575_2"}],"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.1389249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389249","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.1389249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":10,"alternative-id":["10.1145\/1389095.1389249","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389249","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"}}]}}