{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:13Z","timestamp":1750307893572,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"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\/1388969.1389027","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"2089-2092","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A bivariate probabilistic model-building genetic algorithm for graph bipartitioning"],"prefix":"10.1145","author":[{"given":"Dirk","family":"Thierens","sequence":"first","affiliation":[{"name":"Universiteit Utrecht, Utrecht, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"30","volume-title":"Proceedings of the 14th International Conference on Machine Learning","author":"Baluja S.","year":"1997","unstructured":"Baluja , S. &amp; Davies, S. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space . Proceedings of the 14th International Conference on Machine Learning , pp. 30 -- 38 , 1997 . Morgan Kaufmann. Baluja, S. &amp; Davies, S. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. Proceedings of the 14th International Conference on Machine Learning, pp. 30--38, 1997. Morgan Kaufmann."},{"key":"e_1_3_2_1_2_1","first-page":"192","volume-title":"E. D. Learning Probabilistic Tree Grammars for Genetic Programming. Proceedings of Parallel Problem Solving from Nature - PPSN VIII","author":"Bosman P.A.N.","year":"2004","unstructured":"Bosman , P.A.N. &amp; de Jong , E. D. Learning Probabilistic Tree Grammars for Genetic Programming. Proceedings of Parallel Problem Solving from Nature - PPSN VIII , pp. 192 -- 201 , 2004 . Springer-Verlag. Bosman, P.A.N. &amp; de Jong, E. D. Learning Probabilistic Tree Grammars for Genetic Programming. Proceedings of Parallel Problem Solving from Nature - PPSN VIII, pp. 192--201, 2004. Springer-Verlag."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645826.669274"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/800263.809204"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.6.865"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000026263.43711.44"},{"key":"e_1_3_2_1_8_1","volume-title":"The Design and Analysis of Algorithms","author":"Levitin A.","year":"2007","unstructured":"Levitin , A. The Design and Analysis of Algorithms . 2 nd edition, 2007 , Pearson . Levitin, A. The Design and Analysis of Algorithms. 2nd edition, 2007, Pearson.","edition":"2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568103"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0819-1_39"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013500812258"}],"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 companion on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1388969.1389027","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1388969.1389027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:22Z","timestamp":1750258042000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1388969.1389027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":11,"alternative-id":["10.1145\/1388969.1389027","10.1145\/1388969"],"URL":"https:\/\/doi.org\/10.1145\/1388969.1389027","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"}}]}}