{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:45:41Z","timestamp":1725479141249},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262763"},{"type":"electronic","value":"9783540316794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_20","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T21:56:25Z","timestamp":1279144585000},"page":"269-281","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Metrics for Local Search"],"prefix":"10.1007","author":[{"given":"Finnegan","family":"Southey","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"61","volume-title":"Modern Heuristic Search Methods","author":"R. Battiti","year":"1996","unstructured":"Battiti, R.: Reactive search: Toward self\u2013tuning heuristics. In: Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. (eds.) Modern Heuristic Search Methods, pp. 61\u201383. John Wiley & Sons Ltd., Chichester (1996)"},{"key":"20_CR2","unstructured":"Cha, B., Iwama, K.: Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas. In: Proceedings of 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 304\u2013311. Kyushu University (1995)"},{"key":"20_CR3","unstructured":"Cha, B., Iwama, K.: Adding New Clauses for Faster Local Search. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 332\u2013337 (1996)"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On Covering Problems of Codes. Theory of Computing Systems\u00a030, 113\u2013119 (1997)","journal-title":"Theory of Computing Systems"},{"key":"20_CR5","unstructured":"Gent, I.P., Walsh, T.: Towards an Understanding of Hill-Climbing Procedures for SAT. In: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI 1993), pp. 28\u201333 (1993)"},{"key":"20_CR6","first-page":"661","volume-title":"Proceedings of the 16th National Conference on Artificial Intelligence (AAAI 1999)","author":"H. Hoos","year":"1999","unstructured":"Hoos, H.: On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT. In: Proceedings of the 16th National Conference on Artificial Intelligence (AAAI 1999), pp. 661\u2013666. MIT Press, Cambridge (1999)"},{"key":"20_CR7","first-page":"283","volume-title":"Proceedings of the 3rd International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2000)","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An Online Resource for Research on SAT. In: Gent, I.P., von Maaren, H., Walsh, T. (eds.) Proceedings of the 3rd International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2000), pp. 283\u2013292. IOS Press, Amsterdam (2000)"},{"key":"20_CR8","unstructured":"Horvitz, E., Ruan, Y., Gomes, C.P., Kautz, H., Selman, B., Chickering, D.M.: A Bayesian approach to tackling hard computational problems. In: Proceedings of the 17th Conference on Uncertainty and Artificial Intelligence (UAI 2001), August 2001, pp. 235\u2013244 (2001)"},{"key":"20_CR9","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.A.D., Hoos, H.H.: Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 233. Springer, Heidelberg (2002)"},{"key":"20_CR10","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence for Invariants in Local Search. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997). AT&T Laboratories (1997)"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","volume":"132","author":"D. Schuurmans","year":"2001","unstructured":"Schuurmans, D., Southey, F.: Local search characteristics of incomplete SAT procedures. Artificial Intelligence\u00a0132(2), 121\u2013150 (2001)","journal-title":"Artificial Intelligence"},{"key":"20_CR12","unstructured":"Schuurmans, D., Southey, F., Holte, R.C.: The exponentiated subgradient algorithm for heuristic boolean programming. In: Proceedings of 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), vol.\u00a01, pp. 334\u2013341 (2001)"},{"key":"20_CR13","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise Strategies for Improving Local Search. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), July 1994, AT&T Bell Labs (1994)"},{"key":"20_CR14","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI 1992), AT&T, University of Toronto, Simon Fraser, pp. 440\u2013446 (1992)"},{"key":"20_CR15","unstructured":"Thornton, J.R., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus Multiplicative Clause Weighting for SAT. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004) (2004)"},{"key":"20_CR16","unstructured":"Wu, Z., Wah, B.W.: Solving Hard Satisfiability Problems: A Unified Algorithm Based On Discrete Lagrange Multipliers. In: Proceedings of 11th IEEE Conference on Tools with Artificial Intelligence. UIUC (November 1999)"},{"key":"20_CR17","unstructured":"Wu, Z., Wah, B.W.: Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum Satisfiability Problems. In: Proceedings of the 16th National Conference on Artificial Intelligence (AAAI 1999) (1999)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:41:17Z","timestamp":1619505677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11499107_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}