{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:11:48Z","timestamp":1769915508012,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T00:00:00Z","timestamp":1341619200000},"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":[[2012,7,7]]},"DOI":"10.1145\/2330163.2330320","type":"proceedings-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T16:41:12Z","timestamp":1341938472000},"page":"1135-1142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolutionary approaches to the generation of optimal error correcting codes"],"prefix":"10.1145","author":[{"given":"Daniel E.","family":"McCarney","sequence":"first","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheridan","family":"Houghten","sequence":"additional","affiliation":[{"name":"Brock University, St. Catharines, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian J.","family":"Ross","sequence":"additional","affiliation":[{"name":"Brock University, St. Catharines, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854776.1854809"},{"key":"e_1_3_2_1_2_1","volume-title":"How good are genetic algorithms at finding large cliques: an experimental study","author":"Carter B.","year":"1993","unstructured":"B. Carter and K. Park . How good are genetic algorithms at finding large cliques: an experimental study . Boston University , 1993 . B. Carter and K. Park. How good are genetic algorithms at finding large cliques: an experimental study. Boston University, 1993."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057187"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1672041.1672055"},{"issue":"2","key":"e_1_3_2_1_5_1","first-page":"147","article-title":"Error detecting and error correcting codes","volume":"26","author":"Hamming R.","year":"1950","unstructured":"R. Hamming . Error detecting and error correcting codes . Bell System Tech. Journal , 26 ( 2 ): 147 -- 160 , 1950 . R. Hamming. Error detecting and error correcting codes. Bell System Tech. Journal, 26(2):147--160, 1950.","journal-title":"Journal"},{"key":"e_1_3_2_1_6_1","volume-title":"Genetic Programming","author":"Haynes T.","year":"1996","unstructured":"T. Haynes and D. Schoenefeld . Clique detection via genetic programming . In Genetic Programming , 1996 . T. Haynes and D. Schoenefeld. Clique detection via genetic programming. In Genetic Programming, 1996."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011925109392"},{"key":"e_1_3_2_1_8_1","unstructured":"S. Luke. ECJ 2012.  S. Luke. ECJ 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/330560.330841"},{"key":"e_1_3_2_1_10_1","volume-title":"Optimization","author":"Pelillo M.","year":"2001","unstructured":"M. Pelillo . Encyc. Optimization , chapter Heuristics for maximum clique and independent set. Kluwer , 2001 . M. Pelillo. Encyc. Optimization, chapter Heuristics for maximum clique and independent set. Kluwer, 2001."},{"key":"e_1_3_2_1_11_1","first-page":"400","volume-title":"Genetic Programming","author":"Soule T.","year":"1996","unstructured":"T. Soule , J. Foster , and J. Dickinson . Using genetic programming to approximate maximum clique . In Genetic Programming , pages 400 -- 405 , 1996 . T. Soule, J. Foster, and J. Dickinson. Using genetic programming to approximate maximum clique. In Genetic Programming, pages 400--405, 1996."},{"key":"e_1_3_2_1_12_1","first-page":"6","volume-title":"PPSN III","author":"Whitley D.","year":"1994","unstructured":"D. Whitley , V. S. Gordon , and K. Mathias . Lamarckian evolution, the baldwin effect and function optimization . In PPSN III , pages 6 -- 15 . Springer-Verlag , 1994 . D. Whitley, V. S. Gordon, and K. Mathias. Lamarckian evolution, the baldwin effect and function optimization. In PPSN III, pages 6--15. Springer-Verlag, 1994."}],"event":{"name":"GECCO '12: Genetic and Evolutionary Computation Conference","location":"Philadelphia Pennsylvania USA","acronym":"GECCO '12","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 14th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330320","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2330163.2330320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:09Z","timestamp":1750236549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,7]]},"references-count":12,"alternative-id":["10.1145\/2330163.2330320","10.1145\/2330163"],"URL":"https:\/\/doi.org\/10.1145\/2330163.2330320","relation":{},"subject":[],"published":{"date-parts":[[2012,7,7]]},"assertion":[{"value":"2012-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}