{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:44:17Z","timestamp":1725497057450},"publisher-location":"London","reference-count":12,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781848000933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-1-84800-094-0_5","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T08:25:20Z","timestamp":1196670320000},"page":"51-64","source":"Crossref","is-referenced-by-count":0,"title":["Escaping Local Optima: Constraint Weights vs. Value Penalties"],"prefix":"10.1007","author":[{"given":"Muhammed","family":"Basharu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"In\u00e9s","family":"Arana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hatem","family":"Ahriz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Muhammed Basharu, In\u2019es Arana, and Hatem Ahriz. Solving DisCSPs with penalty-driven search. In Proceedings of AAAI 2005 - the Twentieth National Conference of Artificial Intelligence, pages 47\u201352. AAAI, 2005."},{"key":"5_CR2","unstructured":"Peter Cheeseman, Bob Kanefsky, and William M. Taylor. Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on ArtificialIntelligence, IJCAI-91, Sidney, Australia, pages 331\u2013337, 1991."},{"key":"5_CR3","unstructured":"Jeremy Frank. Learning short-term weights for GSAT. In Martha Pollack, editor, Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI97), pages 384\u2013391, San Francisco, August 1997. Morgan Kaufmann."},{"issue":"3","key":"5_CR4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"Fred Glover","year":"1989","unstructured":"Fred Glover. Tabu search - part I. ORSA Journal on Computing, 1(3):190\u2013206, Summer 1989.","journal-title":"ORSA Journal on Computing"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Katsutoshi Hirayama and Makoto Yokoo. Local search for distributed SAT with complex local problems. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems, AAMAS 2002, pages 1199 \u2013 1206, New York, NY, USA, 2002. ACM Press.","DOI":"10.1145\/545056.545099"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Frank Hutter, Dave A. D. Tompkins, and Holger H. Hoos. Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In P. Van Hentenryck, editor, Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming(CP02), volume 2470 of LNCS, pages 233\u2013248, London, UK, September 2002. Springer-Verlag.","DOI":"10.1007\/3-540-46135-3_16"},{"key":"5_CR7","unstructured":"Patrick Mills. Extensions to Guided Local Search. PhD thesis, University of Essex, Essex, 2002."},{"key":"5_CR8","unstructured":"Paul Morris. The breakout method for escaping from local minima. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 40\u201345, 1995."},{"key":"5_CR9","unstructured":"John Thornton, Duc Nghia Pham, Stuart Bain, and Valnir Ferreira Jr. Additive versus multiplicative clause weighting for SAT. In Proceedings of AAAI\u201904, pages 191\u2013196, 2004."},{"key":"5_CR10","unstructured":"Dave Tompkins and Holger Hoos. Warped landscapes and random acts of SAT solving.In 8th International Symposium on Artificial Intelligence and Mathematics (AMAI 2004), January 2004."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Makoto Yokoo, Edmund H. Durfee, Toru Ishida, and Kazuhiro Kuwabara.Distributed constraint satisfaction for formalizing distributed problem solving. In 12th International Conference on Distributed Computing Systems (ICDCS-92), pages 614\u2013621, 1992.","DOI":"10.1109\/ICDCS.1992.235101"},{"key":"5_CR12","unstructured":"Makoto Yokoo and Katsutoshi Hirayama. Distributed breakout algorithm for solving distributed constraint satisfaction problems. In Proceedings of the Second International Conference on Multi-Agent Systems, pages 401\u2013408. MIT Press, 1996."}],"container-title":["Research and Development in Intelligent Systems XXIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84800-094-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T22:26:03Z","timestamp":1619907963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84800-094-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781848000933"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-84800-094-0_5","relation":{},"subject":[]}}