{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:41:01Z","timestamp":1743010861963,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425120"},{"type":"electronic","value":"9783540446910"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44691-5_11","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:32:07Z","timestamp":1180823527000},"page":"123-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Daisuke","family":"Kawai","sequence":"additional","affiliation":[]},{"given":"Shuichi","family":"Miyazaki","sequence":"additional","affiliation":[]},{"given":"Yasuo","family":"Okabe","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Umemoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1090\/dimacs\/026\/18","volume":"26","author":"Y. Asahiro","year":"1996","unstructured":"Asahiro, Y., Iwama, K. and Miyano, E.,\u201cRandom Generation of Test Instances with Controlled Attributes,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.377\u2013393, 1996.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR2","unstructured":"Cha, B. and Iwama, K.,\u201cPerformance test of local search algorithms using new types of random CNF formulas,\u201d Proc.IJCAI-95, pp.304\u2013310, 1995."},{"key":"11_CR3","unstructured":"Cha, B. and Iwama, K.,\u201cAdding new clauses for faster local search,\u201d Proc.AAAI 96, pp.332\u2013337, 1996."},{"key":"11_CR4","unstructured":"Cha, B., Iwama, K., Kambayashi, Y. and Miyazaki, S.,\u201cLocal search algorithms for Partial MAXSAT,\u201d Proc.AAAI-97, pp.263\u2013268, 1997."},{"key":"11_CR5","unstructured":"Cheeseman, P., Kanefsky, B. and Taylor W.M.,\u201cWhere the really hard problems are,\u201d Proc.IJCAI-91, pp.331\u2013337, 1991."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1090\/dimacs\/026\/20","volume":"26","author":"O. Dubois","year":"1996","unstructured":"Dubois, O., Andre, P., Boufkhad, Y. and Carlier, J.\u201cSAT versus UNSAT,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.415\u2013436, 1996.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR7","unstructured":"Geist, A., Berguelin, A., Dongarra, J., Jiang, W., Manchek, R. and Sunderam, V., Parallel Virtual Machine, The MIT Press, 1994."},{"key":"11_CR8","first-page":"5590","volume":"26","author":"A.V. Gelder","year":"1996","unstructured":"Gelder, A.V. and Tsuji, Y.K.\u201cSatisfiability testing with more reasoning and less guessing,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.5590\u2013586, 1996.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR9","unstructured":"Gent, I., and Walsh, T.,\u201cUnsatisfied variables in local search,\u201d Hybrid Problems, Hybrid Solutions (AISB-95), Amsterdam, 1995."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gu, J.\u201cEfficient local search for very large-scale satisfiability problems,\u201dSigart Bulletin, Vol.3, No.1, pp.8\u201312, 1992.","DOI":"10.1145\/130836.130837"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1090\/dimacs\/026\/21","volume":"26","author":"S. Hampson","year":"1996","unstructured":"Hampson, S. and Kibler, D.\u201cLarge plateaus and plateau search n boolean satisfiability problems: When to give up searching and start again,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.437\u2013455, 1996.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-55179-4_21","volume-title":"Vectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification","author":"H. Hiraishi","year":"1992","unstructured":"Hiraishi, H., Hamaguchi, K., Ochi, H. and Yajima, S.,\u201cVectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification,\u201d Proc. CAV\u2019 91 (LNCS 575), pp.214\u2013224, 1991."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Johnson, D.S. and Trick, M.A. Eds.\u201cCliques,Coloring,and Satisfiability,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1090\/dimacs\/026\/22","volume":"26","author":"B. Jaumard","year":"1996","unstructured":"Jaumard, B., Stan, M. and Desrosiers, J.,\u201cTabu search and a quadratic relaxation for satisfiability problem,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.457\u2013478, 1996.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(92)90029-U","volume":"43","author":"E. Koutsoupias","year":"1992","unstructured":"Koutsoupias, E. and Papadimitriou, C.H.,\u201cOn the greedy algorithm for satisfiability,\u201d Information Processing Letters, Vol.43, pp.53\u201355, 1992.","journal-title":"Information Processing Letters"},{"key":"11_CR16","unstructured":"Mitchell, D., Selman, B. and Levesque, H.,\u201cHard and easy distributions of SAT problems,\u201d Proc.AAAI-92, pp.459\u2013465, 1992."},{"key":"11_CR17","unstructured":"Miyazaki, S., Iwama, K. and Kambayashi, Y.,\u201cDatabase queries as combinatorial optimization problems,\u201d Proc.CODAS\u2019 96, pp.448\u2013454, 1996."},{"key":"11_CR18","unstructured":"Morris, P.,\u201cThe breakout method for escaping from local minima,\u201d Proc.AAAI-93, pp.40\u201345, 1993."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.,\u201cOn selecting a satisfying truth assignment,\u201d Proc. FOCS\u2019 91, pp.163\u2013169, 1991.","DOI":"10.1109\/SFCS.1991.185365"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Pretolani, D.,\u201cEfficiency and sability of hypergraph SAT algorithms,\u201d in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.479\u2013498, 1996.","DOI":"10.1090\/dimacs\/026\/23"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1090\/dimacs\/026\/24","volume":"26","author":"M.G.C. Resende","year":"1996","unstructured":"Resende, M.G.C. and Feo, T.A.,\u201cA GRASP for satisfiability,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.499\u2013520, 1996.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Schoning, U,\u201cA probabilistic algorithm for k-SAT and constraint satisfaction problems,\u201d Proc.FOCS\u2019 99, pp.410\u2013414, 1999.","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"11_CR23","unstructured":"Selman, B.and Kautz, H., GSAT USER\u2019s GUIDE Version 35, ftp:\/\/ftp.research.att.com\/dist\/ai\/GSAT_USERS_GUIDE ,1993."},{"key":"11_CR24","unstructured":"Selman, B. and Kautz, H.,\u201cAn empirical study of greedy local search for satisfiability testing,\u201d Proc.AAAI-93, pp.46\u201351, 1993."},{"key":"11_CR25","unstructured":"Selman, B. and Kautz, H.,\u201cLocal search strategies for satisfiability testing,\u201d 2nd DIMACS Challenge Workshop, 1993."},{"key":"11_CR26","unstructured":"Selman, B., Levesque, H.J. and Mitchell, D.G.,\u201cA new method for solving hard satisfiability problems,\u201d Proc.AAAI-92, pp.440\u2013446, 1992."},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1090\/dimacs\/026\/25","volume":"26","author":"B. Selman","year":"1996","unstructured":"Selman, B., Kautz, H. and Cohen, B.,\u201cLocal Search Strategies for Satisfiability Testing,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science,volume 26, American Mathematical Society, pp.521\u2013531, 1996.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Spears, W.M.\u201cSimulated annealingfor hard satisfiability problems,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.533\u2013557, 1996.","DOI":"10.1090\/dimacs\/026\/26"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44691-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:47:46Z","timestamp":1737064066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44691-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425120","9783540446910"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-44691-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"24 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}