{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:09Z","timestamp":1725533889507},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_30","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"312-325","source":"Crossref","is-referenced-by-count":19,"title":["Restart Strategy Selection Using Machine Learning Techniques"],"prefix":"10.1007","author":[{"given":"Shai","family":"Haim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A.: Adaptive Restart Strategies for Conflict Driven SAT Solvers. In: Proc. of the 11th Int. Conf. on Theory and Applications of Satisfiability Testing (2008)","DOI":"10.1007\/978-3-540-79719-7_4"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"4","author":"A. Biere","year":"2008","unstructured":"Biere, A.: PicoSAT Essentials. Journal on Satisfiability, Boolean Modeling and Computation\u00a04, 75\u201397 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"30_CR3","unstructured":"Bregman, D., Mitchell, D.: The SAT solver MXC (version 0.75). Solver Description for the SAT Race 2008 solver competition (2008)"},{"key":"30_CR4","unstructured":"Devlin, D., O\u2019Sullivan, B.: Satisfiability as a Classification Problem. In: Proc. of the 19th Irish Conf. on Artificial Intelligence and Cognitive Science (2008)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Proc. of the 6th Int. Conf. on Theory and Applications of Satisfiability Testing (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Eibach, T., Pilz, E., V\u00f6lkel, G.: Attacking Bivium Using Using SAT Solvers. In: Proc. of the 11th Int. Conf. on Theory and Applications of Satisfiability Testing (2008)","DOI":"10.1007\/978-3-540-79719-7_7"},{"key":"30_CR7","unstructured":"Frost, D., Rish, I.: Summarizing CSP hardness with continuous probability distributions. In: Proc. of the 14th National Conf. on Artificial Intelligence (1997)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: Proc. of Design Automation and Test in Europe (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"30_CR9","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting Combinatorial Search through Randomization. In: Proc. of the 15th National Conf. on Artificial Intelligence (1998)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Haim, S., Walsh, T.: Online Estimation of SAT Solving Runtime. In: Proc. of the 11th Int. Conf. on Theory and Applications of Satisfiability Testing (2008)","DOI":"10.1007\/978-3-540-79719-7_12"},{"key":"30_CR11","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. In: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (2007)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Huang, J.: A Case for Simple SAT Solvers. In: Proc. of the 13th Int. Conf. on Principles and Practice of Constraint Programming (2007)","DOI":"10.1007\/978-3-540-74970-7_62"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hamadi, Y., Hoos, H., Leyton-Brown, K.: Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms. In: Proc. of the 12th Int. Conf. on Principles and Practice of Constraint Programming (2006)","DOI":"10.1007\/11889205_17"},{"key":"30_CR14","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic Restart Policies. In: Proc. of the 18th National Conf. on Artificial Intelligence (2002)"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TPAMI.2005.127","volume":"27","author":"B. Krishnapuram","year":"2005","unstructured":"Krishnapuram, B., Figueiredo, M., Carin, L., Hartemink, A.: Sparse Multinomial Logistic Regression: Fast Algorithms and Generalization Bounds. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027, 957\u2013968 (2005)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. In: Proc. of the 2nd Israel Symp. on the Theory and Computing Systems (1993)","DOI":"10.1109\/ISTCS.1993.253477"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proc. of the 38th Design Automation Conference (2001)","DOI":"10.1145\/378239.379017"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. In: Wallace, M. (ed.) CP 2004, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-46135-3_38","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"Y. Ruan","year":"2002","unstructured":"Ruan, Y., Horvitz, E., Kautz, H.: Restart Policies with Dependence among Runs: A Dynamic Programming Approach. In: Van Hentenryck, P. (ed.) CP 2002, vol.\u00a02470, p. 573. Springer, Heidelberg (2002)"},{"key":"30_CR20","unstructured":"Ruan, Y., Horvitz, E., Kautz, H.: Hardness-aware restart policies. In: The 18th Int. Joint Conference on Artificial Intelligence: Workshop on Stochastic Search (2003)"},{"key":"30_CR21","unstructured":"Ryan, L.: Efficient algorithms for clause learning SAT solvers. Master thesis, Simon Fraser University, School of Computing Science (2004)"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-79719-7_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"V. Ryvchin","year":"2008","unstructured":"Ryvchin, V., Strichman, O.: Local Restarts. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 271\u2013276. Springer, Heidelberg (2008)"},{"key":"30_CR23","unstructured":"Walsh, T.: Search in a Small World. In: Proc. of the 12th Int. Joint Conference on Artificial Intelligence (1999)"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-540-74970-7_48","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"H. Wu","year":"2007","unstructured":"Wu, H., van Beek, P.: On Universal Restart Strategies for Backtracking Search. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 681\u2013695. Springer, Heidelberg (2007)"},{"key":"30_CR25","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: Portfolio-based Algorithm Selection for SAT. Journal of Artificial Intelligence Research\u00a032, 565\u2013606 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-540-74970-7_49","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hierarchical Hardness Models for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 696\u2013711. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T01:25:56Z","timestamp":1589937956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}