{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T10:18:52Z","timestamp":1791109132887,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-2009-5"],"award-info":[{"award-number":["FP7-ICT-2009-5"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2480362.2480588","type":"proceedings-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T19:47:45Z","timestamp":1367437665000},"page":"1196-1203","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Using cross-entropy for satisfiability"],"prefix":"10.1145","author":[{"given":"Hana","family":"Chockler","sequence":"first","affiliation":[{"name":"IBM Research, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Ivrii","sequence":"additional","affiliation":[{"name":"IBM Research, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arie","family":"Matsliah","sequence":"additional","affiliation":[{"name":"IBM Research, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone Fulvio","family":"Rollini","sequence":"additional","affiliation":[{"name":"University of Lugano, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natasha","family":"Sharygina","sequence":"additional","affiliation":[{"name":"University of Lugano, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Annals of Operations Research","author":"Alon G.","year":"2004","unstructured":"G. Alon , D. Kroese , T. Raviv , and R. Rubinstein . Application of the cross-entropy method to buffer allocation problem in simulation-based environment . Annals of Operations Research , 2004 . G. Alon, D. Kroese, T. Raviv, and R. Rubinstein. Application of the cross-entropy method to buffer allocation problem in simulation-based environment. Annals of Operations Research, 2004."},{"key":"e_1_3_2_1_2_1","first-page":"55","volume-title":"LSCS","author":"Audemard G.","year":"2009","unstructured":"G. Audemard , J. Lagniez , B. Mazure , and L. Sais . Integrating conflict driven clause learning to local search . In LSCS , pages 55 -- 68 , 2009 . G. Audemard, J. Lagniez, B. Mazure, and L. Sais. Integrating conflict driven clause learning to local search. In LSCS, pages 55--68, 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2009.71"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_28"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333874.1334131"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00593-0_14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.11.005"},{"key":"e_1_3_2_1_8_1","volume-title":"Solving satisfiability problems using a combination of systematic and local search","author":"Crawford J.","year":"1996","unstructured":"J. Crawford . Solving satisfiability problems using a combination of systematic and local search . In Rutgers University , 1996 . J. Crawford. Solving satisfiability problems using a combination of systematic and local search. In Rutgers University, 1996."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"e_1_3_2_1_11_1","volume-title":"Master Thesis","author":"Dubin U.","year":"2002","unstructured":"U. Dubin . The cross-entropy method for combinatorial optimization with applications . Master Thesis , The Technion , 2002 . U. Dubin. The cross-entropy method for combinatorial optimization with applications. Master Thesis, The Technion, 2002."},{"key":"e_1_3_2_1_12_1","first-page":"502","volume-title":"SAT","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n and N. S\u00f6rensson . An extensible SAT-solver . In SAT , pages 502 -- 518 , 2003 . N. E\u00e9n and N. S\u00f6rensson. An extensible SAT-solver. In SAT, pages 502--518, 2003."},{"key":"e_1_3_2_1_13_1","first-page":"161","volume-title":"Complete local search for propositional satisfiability","author":"Fang H.","year":"2004","unstructured":"H. Fang and W. Ruml . Complete local search for propositional satisfiability . In Association for the Advancement of Artificial Intelligence, pages 161 -- 166 , 2004 . H. Fang and W. Ruml. Complete local search for propositional satisfiability. In Association for the Advancement of Artificial Intelligence, pages 161--166, 2004."},{"key":"e_1_3_2_1_14_1","first-page":"1307","volume-title":"DATE","author":"Fang L.","year":"2007","unstructured":"L. Fang and M. Hsiao . A new hybrid solution to boost SAT solver performance . In DATE , pages 1307 -- 1313 , 2007 . L. Fang and M. Hsiao. A new hybrid solution to boost SAT solver performance. In DATE, pages 1307--1313, 2007."},{"key":"e_1_3_2_1_15_1","volume-title":"Walksat as an informed heuristic to DPLL in SAT solving. Technical report","author":"Ferris B.","year":"2004","unstructured":"B. Ferris and J. Froehlich . Walksat as an informed heuristic to DPLL in SAT solving. Technical report , 2004 . B. Ferris and J. Froehlich. Walksat as an informed heuristic to DPLL in SAT solving. Technical report, 2004."},{"key":"e_1_3_2_1_16_1","first-page":"28","volume-title":"AAAI","author":"Gent I.","year":"1993","unstructured":"I. Gent and T. Walsh . Towards an understanding of hill-climbing procedures for SAT . In AAAI , pages 28 -- 33 , 1993 . I. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In AAAI, pages 28--33, 1993."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647489.727153"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-004-9421-4"},{"key":"e_1_3_2_1_19_1","first-page":"661","volume-title":"AAAI\/IAAI","author":"Hoos H.","year":"1999","unstructured":"H. Hoos . On the run-time behaviour of stochastic local search algorithms for SAT . In AAAI\/IAAI , pages 661 -- 666 , 1999 . H. Hoos. On the run-time behaviour of stochastic local search algorithms for SAT. In AAAI\/IAAI, pages 661--666, 1999."},{"key":"e_1_3_2_1_20_1","volume-title":"Foundations and Applications. Morgan Kaufmann\/Elsevier","author":"Hoos H.","year":"2004","unstructured":"H. Hoos and T. St\u00fctzle . Stochastic Local Search . Foundations and Applications. Morgan Kaufmann\/Elsevier , 2004 . H. Hoos and T. St\u00fctzle. Stochastic Local Search. Foundations and Applications. Morgan Kaufmann\/Elsevier, 2004."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00221-7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1030453.1030500"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118014967"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789854.1789871"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_30"},{"issue":"1","key":"e_1_3_2_1_27_1","first-page":"215","article-title":"On the convergence of the cross-entropy method","volume":"134","author":"Margolin L.","year":"1975","unstructured":"L. Margolin . On the convergence of the cross-entropy method . Annals of Operations Research , 134 ( 1 ): 215 -- 238 , 1975 . L. Margolin. On the convergence of the cross-entropy method. Annals of Operations Research, 134(1):215--238, 1975.","journal-title":"Annals of Operations Research"},{"key":"e_1_3_2_1_28_1","volume-title":"Master Thesis","author":"Margolin L.","year":"2002","unstructured":"L. Margolin . Cross-entropy method for combinatorial optimization . Master Thesis , The Technion , 2002 . L. Margolin. Cross-entropy method for combinatorial optimization. Master Thesis, The Technion, 2002."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018999721141"},{"key":"e_1_3_2_1_30_1","first-page":"321","volume-title":"AAAI\/IAAI","author":"McAllester D.","year":"1997","unstructured":"D. McAllester , B. Selman , and H. Kautz . Evidence for invariants in local search . In AAAI\/IAAI , pages 321 -- 326 , 1997 . D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In AAAI\/IAAI, pages 321--326, 1997."},{"key":"e_1_3_2_1_31_1","unstructured":"MiniSAT Web page. http:\/\/minisat.se\/.  MiniSAT Web page. http:\/\/minisat.se\/."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768142.1768170"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00385-2"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/511442.511444"},{"key":"e_1_3_2_1_36_1","volume-title":"Monte-Carlo Simulation and Machine Learning. Information Science and Statistics","author":"Rubinstein R.","year":"2004","unstructured":"R. Rubinstein and D. Kroese . The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization , Monte-Carlo Simulation and Machine Learning. Information Science and Statistics . Springer-Verlag , 2004 . R. Rubinstein and D. Kroese. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Information Science and Statistics. Springer-Verlag, 2004."},{"key":"e_1_3_2_1_37_1","unstructured":"RuleBase PE. www.haifa.il.ibm.com\/projects\/verification\/RB_Homepage.  RuleBase PE. www.haifa.il.ibm.com\/projects\/verification\/RB_Homepage."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00151-5"},{"key":"e_1_3_2_1_39_1","first-page":"337","volume-title":"AAAI","author":"Selman B.","year":"1994","unstructured":"B. Selman , H. Kautz , and B. Cohen . Noise strategies for improving local search . In AAAI , pages 337 -- 343 , 1994 . B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In AAAI, pages 337--343, 1994."},{"key":"e_1_3_2_1_40_1","first-page":"50","volume-title":"IJCAI (1)","author":"Selman B.","year":"1997","unstructured":"B. Selman , H. Kautz , and D. McAllester . Ten challenges in propositional reasoning and search . In IJCAI (1) , pages 50 -- 54 , 1997 . B. Selman, H. Kautz, and D. McAllester. Ten challenges in propositional reasoning and search. In IJCAI (1), pages 50--54, 1997."},{"key":"e_1_3_2_1_41_1","first-page":"440","volume-title":"AAAI","author":"Selman B.","year":"1992","unstructured":"B. Selman , H. Levesque , and D. Mitchell . A new method for solving hard satisfiability problems . In AAAI , pages 440 -- 446 , 1992 . B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In AAAI, pages 440--446, 1992."},{"key":"e_1_3_2_1_42_1","first-page":"62","volume-title":"EPIA","author":"Silva J. P. M.","year":"1999","unstructured":"J. P. M. Silva . The impact of branching heuristics in propositional satisfiability algorithms . In EPIA , pages 62 -- 74 , 1999 . J. P. M. Silva. The impact of branching heuristics in propositional satisfiability algorithms. In EPIA, pages 62--74, 1999."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.53"}],"event":{"name":"SAC '13: SAC '13","location":"Coimbra Portugal","acronym":"SAC '13","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 28th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480588","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480362.2480588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:38Z","timestamp":1750235738000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":43,"alternative-id":["10.1145\/2480362.2480588","10.1145\/2480362"],"URL":"https:\/\/doi.org\/10.1145\/2480362.2480588","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}