Evaluating component solver contributions to portfolio-based algorithm selectors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7317 LNCS, Issue , 2012, Pages 228-241

  Xu, Lin ^a   Hutter, Frank ^a   Hoos, Holger ^a   Leyton Brown, Kevin ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED METHODS; SOLUTION STRATEGY; STATE OF THE ART; STATE-OF-THE-ART METHODS;

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC;

ALGORITHMS;

EID: 84864232264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31612-8_18     Document Type: Conference Paper

References (32)

1. 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-320 (1999)
2. Breiman, L.: Random forests. Machine Learning 45(1), 5-32 (2001)
3. Carchrae, T., Beck, J.C.: Applying machine learning to low-knowledge control of optimization algorithms. Computational Intelligence 21(4), 372-387 (2005)
4. Crawford, J.M., Baker, A.B.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Proc. of AAAI 1994, pp. 1092-1097 (1994)
5. Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
6. Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence 47(3-4), 295-328 (2007)
7. Gebruers, C., Hnich, B., Bridge, D.G., Freuder, E.C.: Using CBR to Select Solution Strategies in Constraint Programming. In: Muñoz-Ávila, H., Ricci, F. (eds.) ICCBR 2005. LNCS (LNAI), vol. 3620, pp. 222-236. Springer, Heidelberg (2005)
8. 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)
9. Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126(1-2), 43-62 (2001)
10. Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: Proc. of ECAI 2004, pp. 475-479 (2004)
11. Helmert, M., Róger, G., Karpas, E.: Fast downward stone soup: A baseline for building planner portfolios. In: Proc. of ICAPS-PAL 2011, pp. 28-35 (2011)
12. Horvitz, E., Ruan, Y., Gomes, C.P., Kautz, H., Selman, B., Chickering, D.M.: A Bayesian approach to tackling hard computational problems. In: Proc. of UAI 2001, pp. 235-244 (2001)
13. Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 265, 51-54 (1997)
14. 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-469. Springer, Heidelberg (2011)
15. Kautz, H.A., Selman, B.: Unifying SAT-based and graph-based planning. In: Proc. of IJCAI 1999, pp. 318-325 (1999)
16. Lagoudakis, M.G., Littman, M.L.: Learning to select branching rules in the DPLL procedure for satisfiability. Electronic Notes in Discrete Mathematics, pp. 344-359 (2001)
17. Le Berre, D., Roussel, O., Simon, L.: The international SAT Competitions web page (2012), http://www.satcompetition.org (last visited on January 29, 2012)
18. Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proc. of IJCAI 2003, pp. 1542-1543 (2003)
19. Nudelman, E., Leyton-Brown, K., Devkar, A., Shoham, Y., Hoos, H.: Satzilla: An algorithm portfolio for SAT. In: Solver Description, SAT Competition 2004 (2004)
20. Petri, M., Zilberstein, S.: Learning parallel portfolios of algorithms. Annals of Mathematics and Artificial Intelligence 48(1-2), 85-106 (2006)
21. Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65-118 (1976)
22. Roussel, O.: Description of ppfolio (2011), http://www.cril.univ-artois. fr/~roussel/ppfolio/solver1.pdf, Solver description (last visited on May 1, 2012)
23. Samulowitz, H., Memisevic, R.: Learning to solve QBF. In: Proc. of AAAI 2007, pp. 255-260 (2007)
24. Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Computing Surveys 41(1) (2008)
25. Stephan, P., Brayton, R., Sangiovanni-Vencentelli, A.: Combinational test generation using satisfiability. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, 1167-1176 (1996)
26. Stern, D., Herbrich, R., Graepel, T., Samulowitz, H., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: Proc. of AAAI 2010, pp. 210-216 (2010)
27. Streeter, M.J., Smith, S.F.: New techniques for algorithm portfolio design. In: Proc. of UAI 2008, pp. 519-527 (2008)
28. Sutcliffe, G., Suttner, C.B.: Evaluating general purpose automated theorem proving systems. Artificial Intelligence Journal 131(1-2), 39-54 (2001)
29. Ting, K.M.: An instance-weighting method to induce cost-sensitive trees. IEEE Transactions on Knowledge and Data Engineering 14(3), 659-665 (2002)
30. van Gelder, A.: Another look at graph coloring via propositional satisfiability. In: Proc. of COLOR 2002, pp. 48-54 (2002)
31. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32, 565-606 (2008)
32. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: Automated algorithm configuration and selection for mixed integer programming. In: Proc. of IJCAI-RCRA 2011 (2011)