{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:12Z","timestamp":1725483852446},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_15","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"216-232","source":"Crossref","is-referenced-by-count":18,"title":["Accelerating Random Walks"],"prefix":"10.1007","author":[{"given":"Wei","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"15_CR1","unstructured":"F. Bacchus and P. van Beek. On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. In Proceedings of AAAI-98, pages 311\u2013318, 1998."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, 7: 201\u2013205, 1960.","journal-title":"Journal of the ACM"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem-Proving. Communications of the ACM, 5:394\u2013397, 1962.","journal-title":"Communications of the ACM"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"B. Bonet and H. Geffner. Planning as Heuristic Search. Artificial Intelligence, Special issue on Heuristic Search. Vol 129(1\u20132) 2001.","DOI":"10.1016\/S0004-3702(01)00108-4"},{"key":"15_CR5","unstructured":"R. I. Brafman. A Simplifier for Propositional Formulas with Many Binary Clauses, In Proceedings IJCAI-2001, Seattle, WA, pages 515\u2013520, 2001."},{"key":"15_CR6","unstructured":"B. Cha and K. Iwama. Adding New Clauses for Faster Local Search. In Proceedings AAAI-96, pages 332\u2013337, 1996."},{"key":"15_CR7","unstructured":"L. Drake, A. Frisch, and T. Walsh. Adding resolution to the DPLL procedure for Satisfiability. In Proceedings of SAT2002, pages 122\u2013129, 2002."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"I. Gent and T. Walsh. An Empirical Analysis of Search in GSAT. JAIR, 1993.","DOI":"10.1613\/jair.7"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"C. P. Gomes, B. Selman, N. Crator, and H. Kautz. Heavy-Tailed Phenomenia in Satisfiability and Constraint Satisfication Problems. Journal of Automated Reasoning, Vol 24, No 1\u20132, February 2000.","DOI":"10.1023\/A:1006314320276"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/130836.130837","volume":"3","author":"J. Gu","year":"1992","unstructured":"J. Gu. Efficient Local Search for Very Large-Scale Satisfiability Problems. SIGART Bulletin 3(1): 8\u201312, 1992.","journal-title":"SIGART Bulletin"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"E. A. Hirsch and A. Kojevnikov. Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. In Proc. of CP-2001, 2001.","DOI":"10.1007\/3-540-45578-7_48"},{"key":"15_CR12","unstructured":"H. Kautz and B. Selman. Unifying SAT-based and Graph-based Planning. In Proceedings of IJCAI-99, Stockholm, 1999."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"J. Kleinberg. Navigation in a small-world. Nature, 406, 2000.","DOI":"10.1038\/35022643"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B. W. Kernighan. An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, Vol. 21, 2, pages 498\u2013516, 1973.","journal-title":"Operations Research"},{"key":"15_CR15","unstructured":"D. A. McAllester, B. Selman, and H. A. Kautz. Evidence for Invariants in Local Search. In Proceedings of AAAI-97, pages 321\u2013326, 1997."},{"key":"15_CR16","unstructured":"P. Morris. Breakout method for escaping from local minima. Proc. AAAI-93, Washington, DC (1993)."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1990","unstructured":"S. Minton, M. D. Johnson, A. B. Philips, and P. Laird. Solving Large-Scale Constraint Satisfaction and Scheduling Problems Using a Heuristic Repair Methods. Artificial Intelligence 58, pages 161\u2013205, 1990.","journal-title":"Artificial Intelligence"},{"key":"15_CR18","unstructured":"M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Engineering a Highly Efficient SAT Solver. 38th Design Autom. Conference (DAC 01), 2001."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou. On Selecting a Satisfying Truth Assignment. In Proceedings of the Conference on the Foundations of Computer Science, pages 163\u2013169, 1991.","DOI":"10.1109\/SFCS.1991.185365"},{"key":"15_CR20","unstructured":"A. J. Parkes and J. P. Walser. Tuning Local Search for Satisfiability Testing. In Proc. AAAI-96, 1996."},{"key":"15_CR21","unstructured":"S. Prestwich. SAT Problems with Chains of Dependent Variables. Unpublished technical note, 2001."},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"U. Schoening. A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. In Proceeedings of FOCS, 1999.","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"15_CR23","unstructured":"D. Schuurmans, F. Southey, and R. C. Holte. The Exponential Subgradient Algorithm for Heuristic Boolean Programming. In Proc. IJCAI-2001, 2001."},{"key":"15_CR24","unstructured":"B. Selman, H. Kautz, and B. Cohen. Local Search Strategies for Satisfiability Testing. 2nd DIMACS Challenge on Cliques, Coloring and Satisfiability, 1994."},{"key":"15_CR25","unstructured":"B. Selman, H. Kautz, and D. McAllester. Ten Challenges in Propositional Reasoning and Search. In Proceedings IJCAI-97, 1997."},{"key":"15_CR26","unstructured":"B. Selman, H. J. Levesque, and D. G. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proceedings AAAI-92, pages 440\u2013446, 1992."},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"T. Suyama, M. Yokoo, and A. Nagoya. Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation. In Proceedings of CP-99, 1999.","DOI":"10.1007\/978-3-540-48085-3_31"},{"key":"15_CR28","unstructured":"M. N. Velev. Benchmark suites SSS-SAT-1.0, SAT-1.0, October 2000. http:\/\/www.ece.cmu.edu\/~mvelev"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"M. N. Velev, and R. E. Bryant. Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors. 38th Design Automation Conference (DAC\u2019 01), June 2001, pp. 226\u2013231.","DOI":"10.1145\/378239.378469"},{"key":"15_CR30","unstructured":"J. P. Walser, R. Iyer and N. Venkatasubramanyan. An Integer Local Search Method with Application to Capacitated Production Planning. In Proceedings of AAAI-98, Madison, WI, 1998."},{"key":"15_CR31","unstructured":"T. Walsh. Search in a Small World. In Proceedings of IJCAI-99, 1999."},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. J. Watts","year":"1998","unstructured":"D. J. Watts and S. Strogatz. Collective dynamics of\u2019 small-world\u2019 networks. Nature, 393, 440\u2013442 (1998).","journal-title":"Nature"},{"key":"15_CR33","unstructured":"Z. Wu and B. W. Wah. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems. Proc. AAAI-2000, 2000."},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"H. Zhang. SATO: An Efficient Propositional Prover. International Conference on Automated Deduction (CADE 97), LNAI 1249, Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63104-6_28"},{"key":"15_CR35","unstructured":"Available at http:\/\/www.cs.washington.edu\/homes\/kautz\/walksat\/"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:25:54Z","timestamp":1556396754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}