{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T10:23:03Z","timestamp":1748600583778},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_23","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:58:57Z","timestamp":1349071137000},"page":"323-338","source":"Crossref","is-referenced-by-count":16,"title":["Learning Algorithm Portfolios for Parallel Execution"],"prefix":"10.1007","author":[{"given":"Xi","family":"Yun","sequence":"first","affiliation":[]},{"given":"Susan L.","family":"Epstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","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)"},{"issue":"3","key":"23_CR2","first-page":"295","volume":"47","author":"M. Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning Dynamic Algorithm Portfolios. Annals of Mathematics and Artificial Intelligence\u00a047(3), 295\u2013328 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Silverthorn, B., Miikkulainen, R.: Latent Class Models for Algorithm Portfolio Methods. In: Twenty-Fourth AAAI Conference on Artificial Intelligence, pp. 167\u2013172 (2010)","DOI":"10.1609\/aaai.v24i1.7546"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Stern, D., Herbrich, R., Graepel, T., Samulowitz, H., Pulina, L., Tacchella, A.: Collaborative Expert Portfolio Management. In: Twenty-Fourth AAAI Conference on Artificial Intelligence, pp. 179\u2013184 (2010)","DOI":"10.1609\/aaai.v24i1.7561"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-540-74970-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 712\u2013727. Springer, Heidelberg (2007)"},{"key":"23_CR6","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: Nineteenth Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"23_CR7","unstructured":"Streeter, M., Golovin, D., Smith, S.F.: Combing Multiple Heuristics Online. In: the Twentysecond National Conference on Artificial Intelligence, pp. 1197-1203 (2007)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C. Gomes","year":"1997","unstructured":"Gomes, C., Selman, B., Crato, N.: Heavy-Tail Distributions in Combinatorial Search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 121\u2013135. Springer, Heidelberg (1997)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"256","author":"B. Huberman","year":"1997","unstructured":"Huberman, B., Lukose, R., Hogg, T.: An Economics Approach to Hard Computational Problems. Science\u00a0256, 51\u201354 (1997)","journal-title":"Science"},{"key":"23_CR10","unstructured":"Gomes, C., Selman, B.: Algorithm Portfolio Design: Theory vs. Practice. In: Thirteenth Conference On Uncertainty in Artificial Intelligence, pp. 190\u2013197. Morgan Kaufmann (1997)"},{"key":"23_CR11","unstructured":"Guerri, A., Milano, M.: Learning Techniques for Automatic Algorithm Portfolio Selection. In: Sixteenth European Conference on Artificial Intelligence, pp. 475\u2013479 (2004)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. In: Twenty-Fourth AAAI Conference on Artificial Intelligence, pp. 179\u2013184 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"23_CR13","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.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":"23_CR14","unstructured":"Horvitz, E., Ruan, Y., Gomes, C.P., Kautz, H.A., Selman, B., Chickering, D.M.: A Bayesian Approach to Tackling Hard Computational Problems. In: Seventeenth Conference in Uncertainty in Artificial Intelligence, pp. 235-244. Morgan Kaufmann Publishers Inc. (2001) 720234"},{"key":"23_CR15","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 Algorithm. Advances in Computers\u00a015, 65\u2013118 (1976)","journal-title":"Advances in Computers"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Gagliolo, M., Schmidhuber, J.: Towards Distributed Algorithm Portoflios. In: International Symposium on Distributed Computing and Artificial Intelligence, pp. 634\u2013643 (2008)","DOI":"10.1007\/978-3-540-85863-8_75"},{"key":"23_CR17","unstructured":"Carchrae, T., Beck, J.C.: Low-Knowledge Algorithm Control. In: Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, pp. 49\u201354. AAAI Press \/ The MIT Press (2004) 1597158"},{"issue":"4","key":"23_CR18","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":"23_CR19","unstructured":"Bordeaux, L., Hamadi, Y., Samulowitz, H.: Experiments with Massively Parallel Constraint Solving. In: Twenty-First International Joint Conference on Artificial Intelligence, pp. 443\u2013448. Morgan Kaufmann Publishers Inc. (2009) 1661516"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-68111-3_27","volume-title":"Parallel Processing and Applied Mathematics","author":"D. Singer","year":"2008","unstructured":"Singer, D., Monnet, A.: JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2007. LNCS, vol.\u00a04967, pp. 249\u2013258. Springer, Heidelberg (2008)"},{"key":"23_CR21","unstructured":"Li, W., van Beek, P.: Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition. In: Sixteenth IEEE International Conference on Tools with Artificial Intelligence, pp. 542\u2013548 (2004)"},{"key":"23_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/SAT190070","volume":"6","author":"Y. Hamadi","year":"2009","unstructured":"Hamadi, Y., Sais, L.: ManySAT: A Parallel SAT Solver. Journal on Satisfiability, Boolean Modeling and Computation\u00a06, 245\u2013262 (2009)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"23_CR23","unstructured":"CPAI (2008), http:\/\/www.cril.univ-artois.fr\/CPAI08\/"},{"key":"23_CR24","unstructured":"Fourth International CSP Solver Competition, http:\/\/www.cril.univ-artois.fr\/CSC09\/"},{"key":"23_CR25","unstructured":"The SAT 2007 Competition, satcompetition.org\/2007\/rules07.html"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Dietterich, T.G.: Ensemble Methods in Machine Learning. In: The First International Workshop on Multiple Classifier Systems, pp. 1\u201315 (2000)","DOI":"10.1007\/3-540-45014-9_1"},{"key":"23_CR27","unstructured":"Streeter, M., Golovin, D., Smith, S.F.: Restart Schedules for Ensembles of Problem Instances. In: The Twenty Second National Conference on Artificial Intelligence, pp. 1204\u20131210 (2007)"},{"key":"23_CR28","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":"23_CR29","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0004-3702(02)00228-X","volume":"140","author":"A.M. Segre","year":"2002","unstructured":"Segre, A.M., Forman, S., Resta, G., Wildenberg, A.: Nagging: A Scalable Fault-Tolerant Paradigm for Distributed Search. Artificial Intelligence\u00a0140, 71\u2013106 (2002)","journal-title":"Artificial Intelligence"},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/s10766-009-0097-6","volume":"37","author":"P. Vander-Swalmen","year":"2009","unstructured":"Vander-Swalmen, P., Dequen, G., Krajecki, M.: A Collaborative Approach for Multi-Threaded SAT Solving. International Journal of Parallel Programming\u00a037, 324\u2013342 (2009)","journal-title":"International Journal of Parallel Programming"},{"key":"23_CR31","unstructured":"Mistral, 4c.ucc.ie\/~ehebrard\/Software.html"},{"key":"23_CR32","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F. Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: An Automatic Algorithm Configuration Framework. Journal of Artificial Intelligence Research\u00a036, 267\u2013306 (2009)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34413-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:54:49Z","timestamp":1687740889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}