{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T10:23:14Z","timestamp":1748600594562,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190839"},{"type":"electronic","value":"9783319190846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_1","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["From Sequential Algorithm Selection to Parallel Portfolio Selection"],"prefix":"10.1007","author":[{"given":"M.","family":"Lindauer","sequence":"first","affiliation":[]},{"given":"H.","family":"Hoos","sequence":"additional","affiliation":[]},{"given":"F.","family":"Hutter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Sellmann, M.: Maxsat by improved instance-specific algorithm configuration. In: Proceedings of AAAI 2014, pp. 2594\u20132600 (2014)","DOI":"10.1007\/978-3-319-11230-5"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-37198-1_14","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"A Arbelaez","year":"2013","unstructured":"Arbelaez, A., Codognet, P.: From sequential to parallel local search for SAT. In: Middendorf, M., Blum, C. (eds.) EvoCOP 2013. LNCS, vol. 7832, pp. 157\u2013168. Springer, Heidelberg (2013)"},{"key":"1_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, New York (2003)"},{"key":"1_CR5","series-title":"Advances in Soft Computing","first-page":"634","volume-title":"International Symposium on Distributed Computing and Artificial Intelligence 2008","author":"M Gagliolo","year":"2008","unstructured":"Gagliolo, M., Schmidhuber, J.: Towards distributed algorithm portfolios. In: Corchado, J.M., Rodr\u00edguez, S., Llinas, J., Molina, J.M. (eds.) DCAI 2008. Advances in Soft Computing, vol. 50, pp. 634\u2013643. Springer, Heidelberg (2008)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the Potsdam answer set solving collection. AI Commun. 24(2), 107\u2013124 (2011)","journal-title":"AI Commun."},{"issue":"2","key":"1_CR7","first-page":"99","volume":"34","author":"Y Hamadi","year":"2013","unstructured":"Hamadi, Y., Wintersteiger, C.: Seven challenges in parallel SAT solving. AI Mag. 34(2), 99\u2013106 (2013)","journal-title":"AI Mag."},{"key":"1_CR8","first-page":"117","volume":"15","author":"H Hoos","year":"2015","unstructured":"Hoos, H., Kaminski, R., Lindauer, M., Schaub, T.: aspeed: solver scheduling via answer set programming. TPLP 15, 117\u2013142 (2015)","journal-title":"TPLP"},{"key":"1_CR9","first-page":"569","volume":"14","author":"H Hoos","year":"2014","unstructured":"Hoos, H., Lindauer, M., Schaub, T.: claspfolio 2: advances in algorithm selection for answer set programming. TPLP 14, 569\u2013585 (2014)","journal-title":"TPLP"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"B Huberman","year":"1997","unstructured":"Huberman, B., Lukose, R., Hogg, T.: An economic approach to hard computational problems. Science 275, 51\u201354 (1997)","journal-title":"Science"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-07046-9_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"B Hurley","year":"2014","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., O\u2019Sullivan, B.: Proteus: a hierarchical portfolio of solvers and transformations. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 301\u2013317. Springer, Heidelberg (2014)"},{"key":"1_CR12","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.: ParamILS: an automatic algorithm configuration framework. JAIR 36, 267\u2013306 (2009)","journal-title":"JAIR"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H., Leyton-Brown, K.: Algorithm runtime prediction: methods and evaluation. J. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"J. Artif. Intell."},{"key":"1_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. 6876, pp. 454\u2013469. Springer, Heidelberg (2011)"},{"key":"1_CR15","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC - instance-specific algorithm configuration. In: Proceedings of ECAI 2010, pp. 751\u2013756 (2010)"},{"issue":"3","key":"1_CR16","first-page":"48","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-319-09584-4_2","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Ranking algorithms by performance. In: Pardalos, P.M., Resende, M.G.C., Vogiatzis, C., Walteros, J.L. (eds.) LION 2014. LNCS, vol. 8426, pp. 16\u201320. Springer, Switzerland (2014)"},{"issue":"3","key":"1_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/AIC-2012-0533","volume":"25","author":"L Kotthoff","year":"2012","unstructured":"Kotthoff, L., Gent, I., Miguel, I.: An evaluation of machine learning in algorithm selection for search problems. AI Commun. 25(3), 257\u2013270 (2012)","journal-title":"AI Commun."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Lindauer, M., Hoos, H., Hutter, F., Schaub, T.: Autofolio: algorithm configuration for algorithm selection. In: Proceedings of Workshops at AAAI 2015 (2015)","DOI":"10.1613\/jair.4726"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-33558-7_38","volume-title":"Principles and Practice of Constraint Programming","author":"Y Malitsky","year":"2012","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Parallel SAT solver selection and scheduling. In: Milano, M. (ed.) Principles and Practice of Constraint Programming. LNCS, pp. 512\u2013526. Springer, Heidelberg (2012)"},{"key":"1_CR21","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: Rossi, F. (ed.) Proceedings of IJCAI 2013, pp. 608\u2013614 (2013)"},{"key":"1_CR22","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Parallel lingeling, ccasat, and csch-based portfolio. In: Proceedings of SAT Competition 2013, pp. 26\u201327 (2013)"},{"key":"1_CR23","first-page":"841","volume":"14","author":"M Maratea","year":"2014","unstructured":"Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. TPLP 14, 841\u2013868 (2014)","journal-title":"TPLP"},{"key":"1_CR24","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Proceedings of AICS 2008 (2008)"},{"key":"1_CR25","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in Python. JMLR 12, 2825\u20132830 (2011)","journal-title":"JMLR"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10601-008-9051-2","volume":"14","author":"L Pulina","year":"2009","unstructured":"Pulina, L., Tacchella, A.: A self-adaptive multi-engine solver for quantified boolean formulas. Constraints 14(1), 80\u2013116 (2009)","journal-title":"Constraints"},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"1_CR28","unstructured":"Streeter, M., Golovin, D., Smith, S.: Combining multiple heuristics online. In: Proceedings of AAAI 2007, pp. 1197\u20131203 (2007)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Tierney, K.: An algorithm selection benchmark of the container pre-marshalling problem. Tech. Rep. DS&OR Working Paper 1402, DS&OR Lab, University of Paderborn (2014)","DOI":"10.1007\/978-3-319-19084-6_2"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: Proceedings of AAAI 2010, pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"1_CR31","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. JAIR 32, 565\u2013606 (2008)","journal-title":"JAIR"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012)"},{"key":"1_CR33","unstructured":"Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: SATzilla2012: improved algorithm selection based on cost-sensitive classification models. In: Proceedings of SAT Challenge 2012, pp. 57\u201358 (2012)"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-34413-8_23","volume-title":"Learning and Intelligent Optimization","author":"X Yun","year":"2012","unstructured":"Yun, X., Epstein, S.L.: Learning algorithm portfolios for parallel execution. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, vol. 7219, pp. 323\u2013338. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19084-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T16:51:40Z","timestamp":1675270300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}