{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:34:42Z","timestamp":1725521682607},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540891963"},{"type":"electronic","value":"9783540891970"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89197-0_38","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T07:23:50Z","timestamp":1228289030000},"page":"405-416","source":"Crossref","is-referenced-by-count":4,"title":["Using Cost Distributions to Guide Weight Decay in Local Search for SAT"],"prefix":"10.1007","author":[{"given":"John","family":"Thornton","sequence":"first","affiliation":[]},{"given":"Duc Nghia","family":"Pham","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of AAAI 1992, pp. 440\u2013446 (1992)"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11499107_12","volume-title":"Theory and Applications of Satisfiability Testing","author":"C.M. Li","year":"2005","unstructured":"Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 158\u2013172. Springer, Heidelberg (2005)"},{"key":"38_CR3","unstructured":"Wu, Z., Wah, B.: An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In: Proceedings of AAAI 2000, pp. 310\u2013315 (2000)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F. Hutter","year":"2002","unstructured":"Hutter, F., Tompkins, D., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 233\u2013248. Springer, Heidelberg (2002)"},{"key":"38_CR5","unstructured":"Mills, P., Tsang, E.: Guided local search applied to the satisfiability (SAT) problem. In: Proceedings of ASOR 1999, pp. 872\u2013883 (1999)"},{"key":"38_CR6","unstructured":"Thornton, J.R., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of AAAI 2004, pp. 191\u2013196 (2004)"},{"key":"38_CR7","unstructured":"Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635\u2013660 (2002)"},{"key":"38_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-76928-6_23","volume-title":"AI 2007: Advances in Artificial Intelligence","author":"D.N. Pham","year":"2007","unstructured":"Pham, D.N., Thornton, J.R., Gretton, C., Sattar, A.: Advances in local search for satisfiability. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol.\u00a04830, pp. 213\u2013222. Springer, Heidelberg (2007)"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-540-74970-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: The design and analysis of an algorithm portfolio for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 712\u2013727. Springer, Heidelberg (2007)"},{"key":"38_CR10","unstructured":"Gagliolo, M., Schmidhuber, J.: Dynamic algorithm portfolios. In: Proceedings of AI-MATH 2006 (2006)"},{"key":"38_CR11","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. In: Proceedings of AAAI 2007, pp. 1152\u20131157 (2007)"},{"key":"38_CR12","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of GECCO 2002, pp. 11\u201318 (2002)"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126, 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11889205_17","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"F. Hutter","year":"2006","unstructured":"Hutter, F., Hamadi, Y., Hoos, H.H., Leyton-Brown, K.: Performance prediction and automated tuning of randomized and parametric algorithms. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 213\u2013228. Springer, Heidelberg (2006)"},{"key":"38_CR15","unstructured":"Carchrae, T., Beck, J.C.: Low-knowledge algorithm control. In: Proceedings of AAAI 2004, pp. 49\u201354 (2004)"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics\u00a02(Article 2) (1997)","DOI":"10.1145\/264216.264220"},{"key":"38_CR17","unstructured":"McAllester, D.A., Selman, B., Kautz, H.A.: Evidence for invariants in local search. In: Proceedings of AAAI 1997, pp. 321\u2013326 (1997)"},{"issue":"1-3","key":"38_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10817-005-9010-1","volume":"35","author":"J. Thornton","year":"2005","unstructured":"Thornton, J.: Clause weighting local search for SAT. Journal of Automated Reasoning\u00a035(1-3), 97\u2013142 (2005)","journal-title":"Journal of Automated Reasoning"},{"issue":"4598","key":"38_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2008: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89197-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T02:48:59Z","timestamp":1551667739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89197-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540891963","9783540891970"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89197-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}