Snappy: A simple algorithm portfolio

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

Volumn 7962 LNCS, Issue , 2013, Pages 422-428

  Samulowitz, Horst ^a   Reddy, Chandra ^a   Sabharwal, Ashish ^a   Sellmann, Meinolf ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM PORTFOLIOS; COMPETITIVE ALGORITHMS; OFF-LINE LEARNING; PROBLEM INSTANCES; SIMPLE ALGORITHM;

FORMAL LOGIC;

ALGORITHMS;

EID: 84879989477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39071-5_33     Document Type: Conference Paper

References (18)

1. Amadini, R., Gabbrielli, M., Mauro, J.: An empirical evaluation of portfolios approaches for solving csps. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 316-324. Springer, Heidelberg (2013)
2. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern sat solver. In: IJCAI 2009 (July 2009)
3. Biere, A.: Lingeling and friends at the sat competition 2011. Technical report, Johannes Kepler University, Altenbergerstr. 69, 4040 Linz, Austria (2011)
4. Cnrs, L.: Choco: an open source java constraint programming library. In: White Paper 14th International Conference on Principles and Practice of Constraint Programming CPAI 2008 Competition, pp. 7-14 (2008), http://www.emn.fr/z-info/choco-solver/pdf/choco-presentation.pdf
5. Gecode Team. Gecode: Generic constraint development environment (2006), http://www.gecode.org
6. Gomes, C., Selman, B.: Algorithm portfolios. Artificial Intelligence Journal 126(1- 2), 43-62 (2001)
7. Huda, M.S., Alam, K.M.R., Mutsuddi, K., Rahman, M.K.S., Rahman, C.M.: A dynamic k-nearest neighbor algorithm for pattern analysis problem. In: 3rd International Conference on Electrical & Computer Engineering (2004)
8. Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65-118 (1976)
9. 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)
10. Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proc. of the 15th Int. Joint Conference on Artificial Intelligence (IJCAI), pp. 1542-1543 (2003)
11. O'Mahony, E., Hebrard, E., Holland, A., Nugent, C., O'Sullivan, B.: Using casebased reasoning in an algorithm portfolio for constraint solving. In: Irish Conference on Artificial Intelligence and Cognitive Science (2008)
12. Soos, M.: CryptoMiniSat 3.1 (2013), http://www.msoos.org/cryptominisat2
13. Sorensson, N., Een, N.: MiniSAT 2.2.0 (2010), http://minisat.se
14. Stern, D., Samulowitz, H., Herbrich, R., Graepel, T., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: AAAI (2010)
15. Streeter, M., Smith, S.: Using decision procedures efficiently for optimization. In: ICAPS, pp. 312-319 (2007)
16. Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for sat. JAIR 32(1), 565-606 (2008)
17. 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-241. Springer, Heidelberg (2012)
18. Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: Satzilla2012: Improved algorithm selection based on cost-sensitive classification models. solver description. In: SAT Challenge 2012 (2012b)