{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T15:17:41Z","timestamp":1782400661976,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441205","type":"print"},{"value":"9783540461357","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_16","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"233-248","source":"Crossref","is-referenced-by-count":73,"title":["Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT"],"prefix":"10.1007","author":[{"given":"Frank","family":"Hutter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dave A. D.","family":"Tompkins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"16_CR1","unstructured":"J. Frank. Learning Short-term Clause Weights for GSAT. In Proc. IJCAI-97, pp. 384\u2013389, Morgan Kaufmann Publishers, 1997."},{"key":"16_CR2","unstructured":"H. H. Hoos. Stochastic Local Search \u2014 Methods, Models, Applications, PhD thesis, Darmstadt University of Technology, 1998."},{"key":"16_CR3","unstructured":"H. H. Hoos. On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT. In Proc. AAAI-99, pp. 661\u2013666. AAAI Press, 1999."},{"key":"16_CR4","unstructured":"H.H. Hoos. An Adaptive Noise Mechanism for WalkSAT. To appear in Proc.AAAI-02, AAAI Press, 2002."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H. H. Hoos","year":"2000","unstructured":"H. H. Hoos and T. St\u00fctzle. Local Search Algorithms for SAT: An Empirical Evaluation. In J. of Automated Reasoning, Vol. 24, No. 4, pp. 421\u2013481, 2000.","journal-title":"J. of Automated Reasoning"},{"key":"16_CR6","unstructured":"H. H. Hoos and T. St\u00fctzle. SATLIB: An Online Resource for Research on SAT. In I.P. Gent, H. Maaren, T. Walsh (ed.), SAT 2000, pp. 283\u2013292, IOS Press, 2000."},{"key":"16_CR7","unstructured":"H. Kautz and B. Selman. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proc. AAAI-96, pp. 1194\u20131201. AAAI Press, 1996."},{"key":"16_CR8","unstructured":"D.A. McAllester and B. Selman and H.A. Kautz. Evidence for Invariants in Local Search. In Proc. AAAI-97, pp. 321\u2013326, AAAI Press, 1997."},{"key":"16_CR9","unstructured":"P. Morris. The breakout method for escaping from local minima. In Proc. AAAI-93, pp. 40\u201345. AAAI Press, 1993."},{"key":"16_CR10","unstructured":"D. Schuurmans, and F. Southey. Local search characteristics of incomplete SAT procedures. In Proc. AAAI-2000, pp. 297\u2013302, AAAI Press, 2000."},{"key":"16_CR11","unstructured":"D. Schuurmans, F. Southey, and R. C. Holte. The exponentiated subgradient algorithm for heuristic boolean programming. In Proc. IJCAI-01, pp. 334\u2013341, Morgan Kaufmann Publishers, 2001."},{"key":"16_CR12","unstructured":"B. Selman and H. A. Kautz. Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. In Proc. IJCAI-93, pp. 290\u2013295, Morgan Kaufmann Publishers, 1993."},{"key":"16_CR13","unstructured":"B. Selman and H. A. Kautz and B. Cohen. Noise Strategies for Improving Local Search. In Proc. AAAI-94, pp. 337\u2013343, AAAI Press, 1994."},{"key":"16_CR14","unstructured":"B. Selman, H. Levesque and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proc. AAAI-92, pp. 440\u2013446, AAAI Press, 1992."},{"key":"16_CR15","unstructured":"Z. Wu and B.W. Wah. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems. In Proc. AAAI-00, pp. 310\u2013315, AAAI Press, 2000."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T16:58:51Z","timestamp":1550336331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}