{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:26Z","timestamp":1725486086382},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410539"},{"type":"electronic","value":"9783540453499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45349-0_20","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T20:54:55Z","timestamp":1181163295000},"page":"262-277","source":"Crossref","is-referenced-by-count":7,"title":["New Search Heuristics for Max-CSP"],"prefix":"10.1007","author":[{"given":"Kalev","family":"Kask","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41\u201385, 1999.","journal-title":"Artificial Intelligence"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1985","unstructured":"R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of a*. Journal of the ACM, 32:506\u2013536, 1985.","journal-title":"Journal of the ACM"},{"key":"20_CR3","unstructured":"R. Dechter and I. Rish. A scheme for approximating probabilistic inference. In Proceedings of Uncertainty in Artificial Intelligence (UAI97), pages 132\u2013141, 1997."},{"key":"20_CR4","unstructured":"I. P. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for sat. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 28\u201333, 1993."},{"key":"20_CR5","unstructured":"K. Kask I. Rish and R. Dechter. Approximation algorithms for probabilistic decoding. In Uncertainty in Artificial Intelligence (UAI-98), 1998."},{"key":"20_CR6","unstructured":"K. Kask and R. Dechter. Branch and bound with mini-bucket heuristics. In Proc. IJCAI, pages 426\u2013433, 1999."},{"key":"20_CR7","unstructured":"K. Kask and R. Dechter. Mini-bucket heuristics for improved search. In Proc. UAI, 1999."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"K. Kask and R. Dechter. Using mini-bucket heuristics for max-csp. UCI Technical report, 2000.","DOI":"10.1007\/3-540-45349-0_20"},{"key":"20_CR9","unstructured":"K. Kask and R. Dechter. Gsat and local consistency. In International Joint Conference on Artificial Intelligence (IJCAI95), pages 616\u2013622, Montreal, Canada, August 1995."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"J. Larossa and P. Meseguer. Partition-based lower bound for max-csp. Proc. CP99, 1999.","DOI":"10.1007\/978-3-540-48085-3_22"},{"key":"20_CR11","unstructured":"P. Morris. The breakout method for escaping from local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 40\u201345, 1993."},{"key":"20_CR12","unstructured":"A. B. Philips, S. Minton, M. D. Johnston and P. Laired. Solving large scale constraint satisfaction and scheduling problems using heuristic repair methods. In National Conference on Artificial Intelligence (AAAI-90), pages 17\u201324, Anaheim, CA, 1990."},{"key":"20_CR13","unstructured":"B. Selman and H. Kautz. An empirical study of greedy local search for satisfiability testing. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 46\u201351, 1993."},{"key":"20_CR14","unstructured":"B. Selman, H. Kautz, and B. Cohen. Noise strategies for local search. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 337\u2013343, 1994."},{"key":"20_CR15","unstructured":"B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. National Conference on Artificial Intelligence (AAAI-92), 1992."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45349-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:40:50Z","timestamp":1556466050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}