{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:41Z","timestamp":1750307261086,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"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":[[2011,3,21]]},"DOI":"10.1145\/1982185.1982386","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"920-921","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel constraint-based local search on the HA8000 supercomputer (abstract)"],"prefix":"10.1145","author":[{"given":"Yves","family":"Caniou","sequence":"first","affiliation":[{"name":"Japan"}]},{"given":"Philippe","family":"Codognet","sequence":"additional","affiliation":[{"name":"University of Tokyo, Japan"}]},{"given":"Daniel","family":"Diaz","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-I Sorbonne, France"}]},{"given":"Salvador","family":"Abreu","sequence":"additional","affiliation":[{"name":"Universidade de Evora and Centria FCT\/UNL, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645844.668485"},{"key":"e_1_3_2_1_2_1","volume-title":"MIC'03","author":"Codognet P.","year":"2003","unstructured":"P. Codognet and D. Diaz . An efficient library for solving CSP with local search. In T. Ibaraki, editor , MIC'03 , 5th International Conference on Metaheuristics , 2003 . P. Codognet and D. Diaz. An efficient library for solving CSP with local search. In T. Ibaraki, editor, MIC'03, 5th International Conference on Metaheuristics, 2003."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15211-5_28"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/647486.726504"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889205_26"},{"key":"e_1_3_2_1_6_1","first-page":"514","volume-title":"Parallelizing constraint programs transparently","author":"Van Hentenryck P.","year":"2007","unstructured":"L. Michel, A. See, and P. Van Hentenryck . Parallelizing constraint programs transparently . In C. Bessiere, editor, proceedings of CP'07, pages 514 -- 528 . Springer Verlag , 2007 . L. Michel, A. See, and P. Van Hentenryck. Parallelizing constraint programs transparently. In C. Bessiere, editor, proceedings of CP'07, pages 514--528. Springer Verlag, 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.08.014"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647486.726496"}],"event":{"name":"SAC'11: The 2011 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"TaiChung Taiwan","acronym":"SAC'11"},"container-title":["Proceedings of the 2011 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982386","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1982185.1982386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:37Z","timestamp":1750243957000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":8,"alternative-id":["10.1145\/1982185.1982386","10.1145\/1982185"],"URL":"https:\/\/doi.org\/10.1145\/1982185.1982386","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}