{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:06Z","timestamp":1725486066510},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_21","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T00:54:55Z","timestamp":1181177695000},"page":"278-290","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing"],"prefix":"10.1007","author":[{"given":"Bhaskar","family":"Krishnamachari","sequence":"first","affiliation":[]},{"given":"Xi","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wicker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"E. H. L. Aarts and J. H. M. Korst, Simulated Annealing and Boltzmann Machines, Wiley, 1989.","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1239\/jap\/1032438383","volume":"35","author":"J. R. Cruz","year":"1998","unstructured":"J. R. Cruz and C. C. Y. Dorea, \u201cSimple conditions for the convergence of simulated annealing type algorithms,\u201d Journal of Applied Probability, vol. 35, no. 4, p. 885\u201392, December 1998.","journal-title":"Journal of Applied Probability"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"A. E. Eiben, E. H. L. Aarts, and K. M. Van Hee, \u201cGlobal convergence of genetic algorithms: a markov chain analysis,\u201d Parallel Problem Solving from Nature, PPSN 1, p. 4\u201312, October 1990.","DOI":"10.1007\/BFb0029725"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/130836.130837","volume":"3","author":"J. Gu","year":"1992","unstructured":"J. Gu, \u201cEfficient Local Search for Very Large Scale Satisfiability Problems,\u201d Sigart Bulletin, vol. 3, no. 1, p. 8\u201312, 1992.","journal-title":"Sigart Bulletin"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"J. Hansen","year":"1990","unstructured":"J. Hansen and B. Jaumard, \u201cAlgorithms for the maximum satisfiability problem,\u201d Computing, vol. 44, pp. 279\u2013303, 1990.","journal-title":"Computing"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D. S. Johnson","year":"1998","unstructured":"D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, \u201cHow easy is local search?,\u201d Journal of Computer and System Sciences, vol. 37, no. 1, p. 79\u2013100, August 1998.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"C. Y. Mao and Y. H. Hu, \u201cAnalysis of Convergence Properties of a Stochastic Evolution Algorithm,\u201d IEEE Transactions on Computer-Aided Design of integrated circuits and systems, vol. 15, no. 7, July 1996.","DOI":"10.1109\/43.503949"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, \u201cConvergence and finite-time behavior of simulated annealing,\u201d Proceedings of the 24th IEEE Conference on Decision and Control, vol. 2, p. 761\u20137, December 1985.","DOI":"10.1109\/CDC.1985.268600"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"A. E. Nix and M. D. Vose, \u201cModeling genetic algorithms with Markov Chains,\u201d Annals of Mathematics and Artificial Intelligence, vol. 5, no. 1, p. 79\u201388.","DOI":"10.1007\/BF01530781"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou, A. A. Schaffer, M. Yannakis, \u201cOn the complexity of local search,\u201d Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, p. 438\u201345, May 1990.","DOI":"10.1145\/100216.100274"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"G. Rudolph, \u201cConvergence Analysis of Canonical Genetic Algorithms,\u201d IEEE Transactions on Neural Networks, vol. 5, no. 1, January 1994.","DOI":"10.1109\/72.265964"},{"key":"21_CR12","first-page":"440","volume-title":"Proceedings AAAI-92","author":"B. Selman","year":"1992","unstructured":"B. Selman, H. J. Levesque and D. G. Mitchell, \u201cA new Method for Solving Hard Satisfiability Problems, Proceedings AAAI-92, San Jose, CA, pp. 440\u2013446, 1992."},{"key":"21_CR13","unstructured":"B. Selman, H. A. Kautz, and B. Cohen, \u201cLocal Search Strategies for Satisfiability Testing,\u201d Second DIMACS Challenge on Cliques, Coloring, and Satisfiability, October 1993."},{"key":"21_CR14","unstructured":"B. Selman, H. A. Kautz, and B. Cohen, \u201cNoise Strategies for Improving Local Search,\u201d Proceedings of Twelfth National Conference on Artificial Intelligence, AAAI-94, vol. 1, pp. 337\u201343, July 1994."},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01759051","volume":"6","author":"G. B. Sorkin","year":"1991","unstructured":"G. B. Sorkin, \u201cEfficient simulated annealing on fractal energy landscapes,\u201d Algorithmica, vol. 6, no. 3, p. 367\u2013418, 1991.","journal-title":"Algorithmica"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"J. C. Spall, S. D. Hill, D. R. Stark, \u201cTheoretical Comparisons of Evolutionary Computation and Other Optimization Approaches,\u201d Congress on Evolutionary Computation, vol. 2, p. 1398\u2013405, July 1999.","DOI":"10.1109\/CEC.1999.782646"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T07:18:00Z","timestamp":1683875880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}