{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:41:53Z","timestamp":1777092113320,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642316111","type":"print"},{"value":"9783642316128","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31612-8_18","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T05:14:42Z","timestamp":1339996482000},"page":"228-241","source":"Crossref","is-referenced-by-count":40,"title":["Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors"],"prefix":"10.1007","author":[{"given":"Lin","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Hutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Hoos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proc. of DAC 1999, pp. 317\u2013320 (1999)","DOI":"10.1145\/309847.309942"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L. Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Machine Learning\u00a045(1), 5\u201332 (2001)","journal-title":"Machine Learning"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1111\/j.1467-8640.2005.00278.x","volume":"21","author":"T. Carchrae","year":"2005","unstructured":"Carchrae, T., Beck, J.C.: Applying machine learning to low-knowledge control of optimization algorithms. Computational Intelligence\u00a021(4), 372\u2013387 (2005)","journal-title":"Computational Intelligence"},{"key":"18_CR4","unstructured":"Crawford, J.M., Baker, A.B.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Proc. of AAAI 1994, pp. 1092\u20131097 (1994)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"3-4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10472-006-9036-z","volume":"47","author":"M. Gagliolo","year":"2007","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence\u00a047(3-4), 295\u2013328 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"18_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11536406_19","volume-title":"Case-Based Reasoning Research and Development","author":"C. Gebruers","year":"2005","unstructured":"Gebruers, C., Hnich, B., Bridge, D.G., Freuder, E.C.: Using CBR to Select Solution Strategies in Constraint Programming. In: Mu\u00f1oz-\u00c1vila, H., Ricci, F. (eds.) ICCBR 2005. LNCS (LNAI), vol.\u00a03620, pp. 222\u2013236. Springer, Heidelberg (2005)"},{"key":"18_CR8","unstructured":"Van Gelder, A., Le Berre, D., Biere, A., Kullmann, O., Simon, L.: Purse-based scoring for comparison of exponential-time programs. In: Proc. of SAT 2005 (2005)"},{"issue":"1-2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126(1-2), 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"18_CR10","unstructured":"Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: Proc. of ECAI 2004, pp. 475\u2013479 (2004)"},{"key":"18_CR11","unstructured":"Helmert, M., R\u00f3ger, G., Karpas, E.: Fast downward stone soup: A baseline for building planner portfolios. In: Proc.\u00a0of ICAPS-PAL 2011, pp. 28\u201335 (2011)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Horvitz, E., Ruan, Y., Gomes, C.P., Kautz, H., Selman, B., Chickering, D.M.: A Bayesian approach to tackling hard computational problems. In: Proc.\u00a0of UAI 2001, pp. 235\u2013244 (2001)","DOI":"10.1016\/S1571-0653(04)00335-X"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"265","author":"B.A. Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science\u00a0265, 51\u201354 (1997)","journal-title":"Science"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S. Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm Selection and Scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 454\u2013469. Springer, Heidelberg (2011)"},{"key":"18_CR15","unstructured":"Kautz, H.A., Selman, B.: Unifying SAT-based and graph-based planning. In: Proc.\u00a0of IJCAI 1999, pp. 318\u2013325 (1999)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Lagoudakis, M.G., Littman, M.L.: Learning to select branching rules in the DPLL procedure for satisfiability. Electronic Notes in Discrete Mathematics, pp. 344\u2013359 (2001)","DOI":"10.1016\/S1571-0653(04)00332-4"},{"key":"18_CR17","unstructured":"Le\u00a0Berre, D., Roussel, O., Simon, L.: The international SAT Competitions web page (2012), \nhttp:\/\/www.satcompetition.org\n (last visited on January 29, 2012)"},{"key":"18_CR18","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proc.\u00a0of IJCAI 2003, pp. 1542\u20131543 (2003)"},{"key":"18_CR19","unstructured":"Nudelman, E., Leyton-Brown, K., Devkar, A., Shoham, Y., Hoos, H.: Satzilla: An algorithm portfolio for SAT. In: Solver Description, SAT Competition 2004 (2004)"},{"issue":"1-2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10472-007-9050-9","volume":"48","author":"M. Petri","year":"2006","unstructured":"Petri, M., Zilberstein, S.: Learning parallel portfolios of algorithms. Annals of Mathematics and Artificial Intelligence\u00a048(1-2), 85\u2013106 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J.R. Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Advances in Computers\u00a015, 65\u2013118 (1976)","journal-title":"Advances in Computers"},{"key":"18_CR22","unstructured":"Roussel, O.: Description of ppfolio (2011), \nhttp:\/\/www.cril.univ-artois.fr\/~roussel\/ppfolio\/solver1.pdf\n, Solver description (last visited on May 1, 2012)"},{"key":"18_CR23","unstructured":"Samulowitz, H., Memisevic, R.: Learning to solve QBF. In: Proc.\u00a0of AAAI 2007, pp. 255\u2013260 (2007)"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Computing Surveys\u00a041(1) (2008)","DOI":"10.1145\/1456650.1456656"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/43.536723","volume":"15","author":"P. Stephan","year":"1996","unstructured":"Stephan, P., Brayton, R., Sangiovanni-Vencentelli, A.: Combinational test generation using satisfiability. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a015, 1167\u20131176 (1996)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Stern, D., Herbrich, R., Graepel, T., Samulowitz, H., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: Proc.\u00a0of AAAI 2010, pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7561"},{"key":"18_CR27","unstructured":"Streeter, M.J., Smith, S.F.: New techniques for algorithm portfolio design. In: Proc.\u00a0of UAI 2008, pp. 519\u2013527 (2008)"},{"issue":"1-2","key":"18_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(01)00113-8","volume":"131","author":"G. Sutcliffe","year":"2001","unstructured":"Sutcliffe, G., Suttner, C.B.: Evaluating general purpose automated theorem proving systems. Artificial Intelligence Journal\u00a0131(1-2), 39\u201354 (2001)","journal-title":"Artificial Intelligence Journal"},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TKDE.2002.1000348","volume":"14","author":"K.M. Ting","year":"2002","unstructured":"Ting, K.M.: An instance-weighting method to induce cost-sensitive trees. IEEE Transactions on Knowledge and Data Engineering\u00a014(3), 659\u2013665 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"18_CR30","unstructured":"van Gelder, A.: Another look at graph coloring via propositional satisfiability. In: Proc.\u00a0of COLOR 2002, pp. 48\u201354 (2002)"},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.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":"18_CR32","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: Automated algorithm configuration and selection for mixed integer programming. In: Proc.\u00a0of IJCAI-RCRA 2011 (2011)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2014 SAT 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31612-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:08:25Z","timestamp":1777090105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31612-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316111","9783642316128"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31612-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}