{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T16:53:35Z","timestamp":1779209615799,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,12,21]],"date-time":"2011-12-21T00:00:00Z","timestamp":1324425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10462-011-9290-2","type":"journal-article","created":{"date-parts":[[2011,12,20]],"date-time":"2011-12-20T10:35:42Z","timestamp":1324377342000},"page":"457-465","source":"Crossref","is-referenced-by-count":22,"title":["Simple algorithm portfolio for SAT"],"prefix":"10.1007","volume":"40","author":[{"given":"Mladen","family":"Nikoli\u0107","sequence":"first","affiliation":[]},{"given":"Filip","family":"Mari\u0107","sequence":"additional","affiliation":[]},{"given":"Predrag","family":"Jani\u010di\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,21]]},"reference":[{"key":"9290_CR1","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui C, Sellmann M, Tierney K (2009) A gender-based genetic algorithm for the automatic configuration of algorithms. In: Proceedings of the 15th international conference on principles and practice of constraint programming. Springer, New York, pp 142\u2013157","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"9290_CR2","volume-title":"Pattern classification","author":"R Duda","year":"2001","unstructured":"Duda R, Hart P, Stork D (2001) Pattern classification. 2nd edn. Wiley-Interscience, New York","edition":"2"},{"issue":"1\u20132","key":"9290_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C Gomes","year":"2001","unstructured":"Gomes C, Selman B (2001) Algorithm portfolios. Artif Intell 126(1\u20132): 43\u201362","journal-title":"Artif Intell"},{"key":"9290_CR4","unstructured":"Horvitz E, Ruan Y, Gomes C, Kautz H, Selman B, Chickering DM (2001) A bayesian approach to tackling hard computational problems. In: UAI, pp 235\u2013244"},{"key":"9290_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"27","author":"B Huberman","year":"1997","unstructured":"Huberman B, Lukose R, Hogg T (1997) An economic approach to hard computational problems. Science 27: 51\u201353","journal-title":"Science"},{"key":"9290_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter F, Hoos H, Leyton-Brown K, St\u00fctzle T (2009) Paramils: an automatic algorithm configuration framework. J Artif Intell Res 36: 267\u2013306","journal-title":"J Artif Intell Res"},{"key":"9290_CR7","unstructured":"Kadioglu S, Malitsky Y, Sellmann M, Tierney K (2010) Isac\u2013instance-specific algorithm configuration In: Proceeding of the 19th European conference on artificial intelligence. IOS press, pp 751\u2013756"},{"key":"9290_CR8","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/S1571-0653(04)00332-4","volume":"9","author":"M Lagoudakis","year":"2001","unstructured":"Lagoudakis M, Littman M (2001) Learning to select branching rules in the dpll procedure for satisfiability. Electron Notes Discret Math 9: 344\u2013359","journal-title":"Electron Notes Discret Math"},{"key":"9290_CR9","doi-asserted-by":"crossref","unstructured":"Malitsky Y, Sabharwal A, Samulowitz H, Sellmann M (2011) Non-model-based algorithm portfolios for SAT. In: Theory and applications of satisfiability testing (SAT), pp 369\u2013370","DOI":"10.1007\/978-3-642-21581-0_33"},{"key":"9290_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10817-009-9127-8","volume":"43","author":"F Mari\u0107","year":"2009","unstructured":"Mari\u0107 F (2009) Formalization and implementation of modern sat solvers. J Autom Reason 43: 81\u2013119","journal-title":"J Autom Reason"},{"key":"9290_CR11","doi-asserted-by":"crossref","unstructured":"Nikoli\u0107 M, Mari\u0107 F, Jani\u010di\u0107 P (2009) Instance-based selection of policies for sat solvers. In: Kullmann O Theory and applications of satisfiability testing\u2014SAT 2009, Vol 5584 of lecture notes in computer science. Springer, Berlin, pp 326\u2013340","DOI":"10.1007\/978-3-642-02777-2_31"},{"key":"9290_CR12","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and practice of constraint programming\u2014CP 2004. Vol 3258 of lecture notes in computer science","author":"E Nudelman","year":"2004","unstructured":"Nudelman E, Brown KL, Hoos HH, Devkar A, Shoham Y (2004) Understanding random SAT: beyond the clauses-to-variables ratio. In: Wallace M (ed) Principles and practice of constraint programming\u2014CP 2004. Vol 3258 of lecture notes in computer science. Springer, Berlin, pp 438\u2013452"},{"key":"9290_CR13","unstructured":"Samulowitz H, Memisevic R (2007) Learning to solve QBF. In: Proceedings of the twenty-second AAAI conference on artificial intelligence. AAAI Press, Vancouver, British Columbia, Canada, pp 255\u2013260"},{"key":"9290_CR14","doi-asserted-by":"crossref","unstructured":"Silverthorn B, Miikkulainen R (2010) Latent class models for algorithm portfolio methods. In: Proceedings of the twenty-fourth AAAI conference on artificial intelligence, pp 167\u2013172","DOI":"10.1609\/aaai.v24i1.7546"},{"issue":"2","key":"9290_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.cmpb.2005.11.007","volume":"81","author":"A Tomovic","year":"2006","unstructured":"Tomovic A, Janicic P, Keselj V (2006) n-Gram-based classification and unsupervised hierarchical clustering of genome sequences. Comput Methods Program Biomed 81(2): 137\u2013153","journal-title":"Comput Methods Program Biomed"},{"key":"9290_CR16","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 (2008) SATzilla: portfolio-based algorithm selection for SAT. J Artif Intell Res 32: 565\u2013606","journal-title":"J Artif Intell Res"},{"key":"9290_CR17","unstructured":"Xu L, Hutter F, Hoos H, Leyton-Brown K (2009) SATzilla2009: an automatic algorithm portfolio for SAT. In: SAT 2009 competitive events booklet, pp 53\u201355"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-011-9290-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-011-9290-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-011-9290-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T23:34:21Z","timestamp":1686526461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-011-9290-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,21]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9290"],"URL":"https:\/\/doi.org\/10.1007\/s10462-011-9290-2","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,21]]}}}