{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T09:24:11Z","timestamp":1774257851369,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,22]],"date-time":"2014-06-22T00:00:00Z","timestamp":1403395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10489-014-0556-7","type":"journal-article","created":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T06:57:50Z","timestamp":1403333870000},"page":"665-680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["More efficient two-mode stochastic local search for random 3-satisfiability"],"prefix":"10.1007","volume":"41","author":[{"given":"Chuan","family":"Luo","sequence":"first","affiliation":[]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[]},{"given":"Shaowei","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,22]]},"reference":[{"issue":"1","key":"556_CR1","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/s10489-013-0444-6","volume":"40","author":"A Abuhamdah","year":"2014","unstructured":"Abuhamdah A, Ayob M, Kendall G, Sabar NR (2014) Population based local search for university course timetabling problems. Appl Intell 40(1):44\u201353","journal-title":"Appl Intell"},{"key":"556_CR2","doi-asserted-by":"crossref","unstructured":"Achlioptas D (2009) Random satisfiability. In: Handbook of Satisfiability, pp. 245\u2013270","DOI":"10.3233\/978-1-58603-929-5-245"},{"issue":"5","key":"556_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/TC.2006.75","volume":"55","author":"FA Aloul","year":"2006","unstructured":"Aloul FA, Sakallah KA, Markov IL (2006) Efficient symmetry breaking for Boolean satisfiability. IEEE Trans Computers 55(5):549\u2013558","journal-title":"IEEE Trans Computers"},{"key":"556_CR4","unstructured":"Aurell E, Gordon U, Kirkpatrick S (2005) Comparing beliefs, surveys and random walks. In: Advances in Neural Information Processing Systems 17, pp. 49\u201356"},{"key":"556_CR5","doi-asserted-by":"crossref","unstructured":"Balint A., Fr\u00f6hlich A. (2010) Improving stochastic local search for SAT with a new probability distribution. In: Proceedings of SAT 2010, pp. 10\u201315","DOI":"10.1007\/978-3-642-14186-7_3"},{"key":"556_CR6","unstructured":"Cai S., Su K. (2011) Local search with configuration checking for SAT. In: Proceedings of ICTAI 2011, pp. 59\u201366"},{"key":"556_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai S, Su K (2013) Local search for Boolean satisfiability with configuration checking and subscore. Artif Intell 204:75\u201398","journal-title":"Artif Intell"},{"key":"556_CR8","doi-asserted-by":"crossref","unstructured":"Cai S, Su K, Chen Q (2010) EWLS: a new local search for minimum vertex cover. In: Proceedings of AAAI 2010, pp. 45\u201350","DOI":"10.1609\/aaai.v24i1.7539"},{"key":"556_CR9","doi-asserted-by":"crossref","unstructured":"Cai S, Su K, Luo C (2013) Improving WalkSAT for random k-satisfiability problem with k > 3. In: Proceedings of AAAI 2013, pp. 145\u2013151","DOI":"10.1609\/aaai.v27i1.8554"},{"issue":"9\u201310","key":"556_CR10","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai S, Su K, Sattar A (2011) Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif Intell 175(9\u201310):1672\u20131696","journal-title":"Artif Intell"},{"issue":"7","key":"556_CR11","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland DW (1962) A machine program for theorem-proving. Commun ACM 5(7):394\u2013397","journal-title":"Commun ACM"},{"issue":"3","key":"556_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis M, Putnam H (1960) A computing procedure for quantification theory. J ACM 7(3):201\u2013215","journal-title":"J ACM"},{"key":"556_CR13","doi-asserted-by":"crossref","unstructured":"Gableske O, Heule M (2011) EagleUP: solving random 3-SAT using SLS with unit propagation. In: Proceedings of SAT 2011, pp. 367\u2013368","DOI":"10.1007\/978-3-642-21581-0_32"},{"key":"556_CR14","unstructured":"Gent IP, Walsh T (1993) Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI 1993, pp. 28\u201333"},{"issue":"3","key":"556_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search - part I. INFORMS J Comput 1(3):190\u2013206","journal-title":"INFORMS J Comput"},{"issue":"1","key":"556_CR16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search - part II. INFORMS J Comput 2(1):4\u201332","journal-title":"INFORMS J Comput"},{"issue":"4","key":"556_CR17","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/21.247892","volume":"23","author":"J Gu","year":"1993","unstructured":"Gu J (1993) Local search for satisfiability (SAT) problem. IEEE Trans Syst Man Cybern 23(4):1108\u20131129","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"556_CR18","unstructured":"Hoos HH, St\u00fctzle T (2004) Stochastic local search: foundations & applications. Elsevier \/ Morgan Kaufmann"},{"key":"556_CR19","doi-asserted-by":"crossref","unstructured":"Hutter F, Tompkins DAD, Hoos HH (2002) Scaling and probabilistic smoothing: efficient dynamic local search for SAT. In: Proceedings of CP 2002, pp. 233\u2013248","DOI":"10.1007\/3-540-46135-3_16"},{"key":"556_CR20","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"S Kirkpatrick","year":"1994","unstructured":"Kirkpatrick S, Selman B (1994) Critical behavior in the satisfiability of random Boolean expressions. Science 264:1297\u20131301","journal-title":"Science"},{"key":"556_CR21","unstructured":"Li CM, Huang WQ (2005) Diversification and determinism in local search for satisfiability. In: Proceedings of SAT 2005, pp. 158\u2013172"},{"key":"556_CR22","unstructured":"Li CM, Li Y (2012) Satisfying versus falsifying in local search for satisfiability. In: Proceedings of SAT 2012, pp. 477\u2013478"},{"key":"556_CR23","unstructured":"Li CM, Wei W, Zhang H (2007) Combining adaptive noise and look-ahead in local search for SAT. In: Proceedings of SAT 2007, pp. 121\u2013133"},{"key":"556_CR24","unstructured":"Luo C, Su K, Cai S (2012) Improving local search for random 3-SAT using quantitative configuration checking. In: Proceedings of ECAI 2012, pp. 570\u2013575"},{"issue":"1","key":"556_CR25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TC.2011.206","volume":"62","author":"TV Luong","year":"2013","unstructured":"Luong TV, Melab N, Talbi EG (2013) GPU computing for parallel local search metaheuristic algorithms. IEEE Trans Comput 62(1):173\u2013185","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"556_CR26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10489-006-8514-7","volume":"24","author":"ME bachir Menai","year":"2006","unstructured":"bachir Menai ME, Batouche M (2006) An effective heuristic algorithm for the maximum satisfiability problem. Appl Intell 24(3):227\u2013239","journal-title":"Appl Intell"},{"key":"556_CR27","unstructured":"Michiels W, Aarts EHL, Korst JHM (2007) Theoretical aspects of local search. Springer"},{"key":"556_CR28","unstructured":"Pham DN, Duong TT, Sattar A (2012) Trap avoidance in local search using pseudo-conflict learning. In: AAAI, pp. 542\u2013548"},{"issue":"2\u20134","key":"556_CR29","first-page":"149","volume":"4","author":"DN Pham","year":"2008","unstructured":"Pham DN, Thornton J, Gretton C, Sattar A (2008) Combining adaptive and dynamic local search for satisfiability. JSAT 4(2\u20134):149\u2013172","journal-title":"JSAT"},{"key":"556_CR30","unstructured":"Selman B, Levesque HJ, Mitchell DG (1992) A new method for solving hard satisfiability problems. In: Proceedings of AAAI 1992, pp. 440\u2013446"},{"issue":"2","key":"556_CR31","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/s10489-009-0189-4","volume":"32","author":"FJM da Silva","year":"2010","unstructured":"da Silva FJM, S\u00e1nchez-P\u00e9rez JM, Pulido JAG, Vega-Rodr\u00edguez MA (2010) AlineaGA - a genetic algorithm with local search optimization for multiple sequence alignment. Appl Intell 32(2):164\u2013172","journal-title":"Appl Intell"},{"key":"556_CR32","unstructured":"Thornton J, Pham DN, Bain S, Ferreira Jr. V (2004) Additive versus multiplicative clause weighting for SAT. In: Proceedings of AAAI 2004, pp. 191\u2013196"},{"key":"556_CR33","unstructured":"Xu L, Hoos HH, Leyton-Brown K (2012) Predicting satisfiability at the phase transition. In: Proceedings of AAAI 2012, pp. 584\u2013590"},{"issue":"3","key":"556_CR34","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TC.2010.270","volume":"61","author":"L Yin","year":"2012","unstructured":"Yin L, He F, Hung WNN, Song X, Gu M (2012) Maxterm covering for satisfiability. IEEE Trans Comput 61(3):420\u2013426","journal-title":"IEEE Trans Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0556-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0556-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0556-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T12:25:44Z","timestamp":1746275144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0556-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,22]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0556-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,22]]}}}