{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:33Z","timestamp":1750308033727,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"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":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144172","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"1087-1094","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Structure and metaheuristics"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Borenstein","sequence":"first","affiliation":[{"name":"University of Essex, Colchester, U.K"}]},{"given":"Riccardo","family":"Poli","sequence":"additional","affiliation":[{"name":"University of Essex, Colchester, U.K"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1162\/evco.1996.4.4.361"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/937503.937505"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1143997.1144172"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1068009.1068248"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1162\/evco.1998.6.2.109"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/S0304-3975(02)00094-4"},{"key":"e_1_3_2_1_7_1","volume-title":"Upper and lower bounds for randomized search heuristics in black-box optimization. Electronic Colloquium on Computational Complexity (ECCC), (048)","author":"Droste S.","year":"2003","unstructured":"S. Droste , T. Jansen , and I. Wegener . Upper and lower bounds for randomized search heuristics in black-box optimization. Electronic Colloquium on Computational Complexity (ECCC), (048) , 2003 . S. Droste, T. Jansen, and I. Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Electronic Colloquium on Computational Complexity (ECCC), (048), 2003."},{"key":"e_1_3_2_1_8_1","first-page":"163","volume-title":"Evolutionary Programming","author":"English T. M.","year":"1996","unstructured":"T. M. English . Evaluation of evolutionary and genetic optimizers: No free lunch . In Evolutionary Programming , pages 163 -- 169 , 1996 . T. M. English. Evaluation of evolutionary and genetic optimizers: No free lunch. In Evolutionary Programming, pages 163--169, 1996."},{"unstructured":"T. M.\n      English\n    .\n  On the structure of sequential search: Beyond \"no free lunch\n  \". In J. Gottlieb and G. R. Raidl editors EvoCOP \n  2004 Coimbra Portugal April 5-7 2004 Proceedings volume \n  3004\n   of \n  Lecture Notes in Computer Science pages \n  95\n  --\n  103\n  . \n  Springer 2004.  T. M. English. On the structure of sequential search: Beyond \"no free lunch\". In J. Gottlieb and G. R. Raidl editors EvoCOP 2004 Coimbra Portugal April 5-7 2004 Proceedings volume 3004 of Lecture Notes in Computer Science pages 95--103. Springer 2004.","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","article-title":"Shannon information and kolmogorov complexity","author":"Grunwald P.","year":"2004","unstructured":"P. Grunwald and P. Vitanyi . Shannon information and kolmogorov complexity . IEEE Transactions on Information Theory , 2004 . In Review. P. Grunwald and P. Vitanyi. Shannon information and kolmogorov complexity. IEEE Transactions on Information Theory, 2004. In Review.","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1023\/B:JMMA.0000049381.24625.f7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/645514.657929"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/978-3-540-24854-5_131"},{"key":"e_1_3_2_1_14_1","article-title":"Abstract geometric crossover for the permutation representation","author":"Moraglio A.","year":"2005","unstructured":"A. Moraglio and R. Poli . Abstract geometric crossover for the permutation representation . IEEE Trans. Evolutionary Computation, page submitted , 2005 . A. Moraglio and R. Poli. Abstract geometric crossover for the permutation representation. IEEE Trans. Evolutionary Computation, page submitted, 2005.","journal-title":"IEEE Trans. Evolutionary Computation, page submitted"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/CEC.2005.1554715"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1080\/08948550302439"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1137\/S0036144501395952"},{"key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1162\/106365602320169839"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1162\/1063656043138941"},{"key":"e_1_3_2_1_21_1","first-page":"565","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001)","author":"Schumacher C.","year":"2001","unstructured":"C. Schumacher , M. D. Vose , and L. D. Whitley . The no free lunch and problem description length. In L. Spector et al. editors , Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) , pages 565 -- 570 , San Francisco, California, USA , 7-11 July 2001 . Morgan Kaufmann. C. Schumacher, M. D. Vose, and L. D. Whitley. The no free lunch and problem description length. In L. Spector et al. editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 565--570, San Francisco, California, USA, 7-11 July 2001. Morgan Kaufmann."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/521897"},{"doi-asserted-by":"crossref","unstructured":"I.\n      Wegener\n    .\n  Towards a theory of randomized search heuristics\n  . In B. Rovan and P. Vojt\u00e1s editors MFCS volume \n  2747\n   of \n  Lecture Notes in Computer Science pages \n  125\n  --\n  141\n  . \n  Springer 2003\n  .  I. Wegener. Towards a theory of randomized search heuristics. In B. Rovan and P. Vojt\u00e1s editors MFCS volume 2747 of Lecture Notes in Computer Science pages 125--141. Springer 2003.","key":"e_1_3_2_1_23_1","DOI":"10.1007\/978-3-540-45138-9_7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/978-3-540-25967-1_10"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/4235.585893"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"acronym":"GECCO06","name":"GECCO06: Genetic and Evolutionary Computation Conference","location":"Seattle Washington USA"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144172","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:10Z","timestamp":1750259650000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":25,"alternative-id":["10.1145\/1143997.1144172","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144172","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}