{"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":1750308033705,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"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.1144176","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"1117-1124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Properties of symmetric fitness functions"],"prefix":"10.1145","author":[{"given":"Sung-Soon","family":"Choi","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]},{"given":"Yung-Keun","family":"Kwon","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/645513.657579"},{"key":"e_1_3_2_1_2_1","first-page":"626","volume-title":"Genetic and Evolutionary Computation Conference","author":"Hoyweghen C. Van","year":"2002","unstructured":"C. Van Hoyweghen , D. E. Goldberg , and B. Naudts . From twomax to the ising model: Easy and hard symmetrical problems . In Genetic and Evolutionary Computation Conference , pages 626 -- 633 , 2002 .]] C. Van Hoyweghen, D. E. Goldberg, and B. Naudts. From twomax to the ising model: Easy and hard symmetrical problems. In Genetic and Evolutionary Computation Conference, pages 626--633, 2002.]]"},{"key":"e_1_3_2_1_3_1","first-page":"97","volume-title":"Parallel Problem Solving from Nature","author":"Watson R. A.","year":"1998","unstructured":"R. A. Watson , G. S. Hornby , and J. B. Pollack . Modeling building block interdependency . In Parallel Problem Solving from Nature , pages 97 -- 106 . Springer-Verlag , 1998 .]] R. A. Watson, G. S. Hornby, and J. B. Pollack. Modeling building block interdependency. In Parallel Problem Solving from Nature, pages 97--106. Springer-Verlag, 1998.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1162\/106365602760972749"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.5555\/521673"},{"key":"e_1_3_2_1_6_1","first-page":"416","volume-title":"Genetic and Evolutionary Computation Conference","author":"Kim S. H.","year":"2001","unstructured":"S. H. Kim , Y. H. Kim , and B. R. Moon . A hybrid genetic algorithm for the max cut problem . In Genetic and Evolutionary Computation Conference , pages 416 -- 423 , 2001 .]] S. H. Kim, Y. H. Kim, and B. R. Moon. A hybrid genetic algorithm for the max cut problem. In Genetic and Evolutionary Computation Conference, pages 416--423, 2001.]]"},{"key":"e_1_3_2_1_7_1","first-page":"45","volume-title":"Fourth International Conference on Genetic Algorithms","author":"Laszewski G.","year":"1991","unstructured":"G. Laszewski . Intelligent structural operators for the k-way graph partitioning problem . In Fourth International Conference on Genetic Algorithms , pages 45 -- 52 , 1991 .]] G. Laszewski. Intelligent structural operators for the k-way graph partitioning problem. In Fourth International Conference on Genetic Algorithms, pages 45--52, 1991.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/12.508322"},{"key":"e_1_3_2_1_9_1","first-page":"159","volume-title":"Genetic and Evolutionary Computation Conference","author":"Kang S. J.","year":"2000","unstructured":"S. J. Kang and B. R. Moon . A hybrid genetic algorithm for multiway graph paritioning . In Genetic and Evolutionary Computation Conference , pages 159 -- 166 , 2000 .]] S. J. Kang and B. R. Moon. A hybrid genetic algorithm for multiway graph paritioning. In Genetic and Evolutionary Computation Conference, pages 159--166, 2000.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/978-3-540-24854-5_109"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/CEC.2000.870766"},{"key":"e_1_3_2_1_12_1","first-page":"694","volume-title":"Genetic and Evolutionary Computation Conference","author":"Hoyweghen C. Van","year":"2001","unstructured":"C. Van Hoyweghen , D. E. Goldberg , and B. Naudts . Building block superiority, multimodality and synchronization problems . In Genetic and Evolutionary Computation Conference , pages 694 -- 701 , 2001 .]] C. Van Hoyweghen, D. E. Goldberg, and B. Naudts. Building block superiority, multimodality and synchronization problems. In Genetic and Evolutionary Computation Conference, pages 694--701, 2001.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1016\/B978-0-08-040806-4.50034-4"},{"key":"e_1_3_2_1_14_1","first-page":"745","volume-title":"Parallel Problem Solving from Nature","author":"Dorne R.","year":"1998","unstructured":"R. Dorne and J. K. Hao . A new genetic local search algorithm for graph coloring . In Parallel Problem Solving from Nature , pages 745 -- 754 . Springer-Verlag , 1998 .]] R. Dorne and J. K. Hao. A new genetic local search algorithm for graph coloring. In Parallel Problem Solving from Nature, pages 745--754. Springer-Verlag, 1998.]]"},{"key":"e_1_3_2_1_15_1","first-page":"327","volume-title":"Genetic and Evolutionary Computation Conference","author":"Choi S. S.","year":"2002","unstructured":"S. S. Choi and B. R. Moon . Isomorphism, normalization, and a genetic algorithm for sorting network optimization . In Genetic and Evolutionary Computation Conference , pages 327 -- 334 , 2002 .]] S. S. Choi and B. R. Moon. Isomorphism, normalization, and a genetic algorithm for sorting network optimization. In Genetic and Evolutionary Computation Conference, pages 327--334, 2002.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1007\/978-3-540-24855-2_42"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/TEVC.2003.818192"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1162\/106365603322519288"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/BF00202749"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/BF01165154"},{"key":"e_1_3_2_1_21_1","first-page":"184","volume-title":"Sixth International Conference on Genetic Algorithms","author":"Jones T.","year":"1995","unstructured":"T. Jones and S. Forrest . Fitness distance correlation as a measure of problem difficulty for genetic algorithms . In Sixth International Conference on Genetic Algorithms , pages 184 -- 192 . Morgan Kaufmann , 1995 .]] T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Sixth International Conference on Genetic Algorithms, pages 184--192. Morgan Kaufmann, 1995.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/0167-6377(94)90065-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1162\/106365600568103"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1109\/4235.887234"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.2307\/2387224"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1162\/evco.1999.7.1.69"},{"key":"e_1_3_2_1_27_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman , San Francisco , 1979 .]] M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/227683.227684"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"e_1_3_2_1_30_1","volume-title":"Computational Complexity","author":"Papadimitriou C. H.","year":"1994","unstructured":"C. H. Papadimitriou . Computational Complexity . Addison-Wesley , 1994 .]] C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.]]"},{"key":"e_1_3_2_1_31_1","first-page":"23","volume-title":"Foundations of Genetic Algorithms","author":"Davidor Y.","year":"1991","unstructured":"Y. Davidor . Epistasis variance : A viewpoint on ga-hardness . In Foundations of Genetic Algorithms , volume 1 , pages 23 -- 35 . Morgan Kaufmann , 1991 .]] Y. Davidor. Epistasis variance: A viewpoint on ga-hardness. In Foundations of Genetic Algorithms, volume 1, pages 23--35. Morgan Kaufmann, 1991.]]"},{"key":"e_1_3_2_1_32_1","first-page":"7","volume-title":"Foundations of Genetic Algorithms","author":"Reeves C.","year":"1995","unstructured":"C. Reeves and C. Wright . An experimental design perspective on genetic algorithms . In Foundations of Genetic Algorithms , volume 3 , pages 7 -- 22 . Morgan Kaufmann , 1995 .]] C. Reeves and C. Wright. An experimental design perspective on genetic algorithms. In Foundations of Genetic Algorithms, volume 3, pages 7--22. Morgan Kaufmann, 1995.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1109\/ANZIIS.1996.573954"},{"key":"e_1_3_2_1_34_1","first-page":"65","volume-title":"Seventh International Conference on Genetic Algorithms","author":"Naudts B.","year":"1997","unstructured":"B. Naudts , D. Suys , and A. Verschoren . Epistasis as a basic concept in formal landscape analysis . In Seventh International Conference on Genetic Algorithms , pages 65 -- 72 . Morgan Kaufmann , 1997 .]] B. Naudts, D. Suys, and A. Verschoren. Epistasis as a basic concept in formal landscape analysis. In Seventh International Conference on Genetic Algorithms, pages 65--72. Morgan Kaufmann, 1997.]]"},{"key":"e_1_3_2_1_35_1","first-page":"57","volume-title":"Parallel Problem Solving from Nature","author":"Manela M.","year":"1992","unstructured":"M. Manela and J. A. Campbell . Harmonic analysis, epistasis and genetic algorithms . In Parallel Problem Solving from Nature , pages 57 -- 64 , 1992 .]] M. Manela and J. A. Campbell. Harmonic analysis, epistasis and genetic algorithms. In Parallel Problem Solving from Nature, pages 57--64, 1992.]]"},{"key":"e_1_3_2_1_36_1","first-page":"287","volume-title":"Artificial Evolution '97","author":"Rochet S.","year":"1997","unstructured":"S. Rochet , G. Venturini , M. Slimane , and E. M. El Kharoubi . A critical and empirical study of epistasis measures for predicting ga performances: A summary . In Artificial Evolution '97 , pages 287 -- 299 , 1997 .]] S. Rochet, G. Venturini, M. Slimane, and E. M. El Kharoubi. A critical and empirical study of epistasis measures for predicting ga performances: A summary. In Artificial Evolution '97, pages 287--299, 1997.]]"},{"key":"e_1_3_2_1_37_1","volume-title":"McGraw Hill","author":"Rudin W.","year":"1987","unstructured":"W. Rudin . Real and Complex Analysis . McGraw Hill , 1987 .]] W. Rudin. Real and Complex Analysis. McGraw Hill, 1987.]]"}],"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.1144176","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144176","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.1144176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":37,"alternative-id":["10.1145\/1143997.1144176","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144176","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"}}]}}