Instance-specific algorithm configuration as a method for non-model-based portfolio generation

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

Volumn 7298 LNCS, Issue , 2012, Pages 244-259

  Malitsky, Yuri ^a   Sellmann, Meinolf ^b  

^a Brown Univerity   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL COMPARISON; STATE-OF-THE-ART ALGORITHMS; TUNING SYSTEM;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ALGORITHMS;

EID: 84861443940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29828-8_16     Document Type: Conference Paper

References (35)

1. Adenso-Diaz, B., Laguna, M.: Fine-tuning of Algorithms using Fractional Experimental Design and Local Search. Operations Research 54(1), 99-114 (2006)
2. Ansótegui, 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-157. Springer, Heidelberg (2009)
3. ArgoSAT, http://argo.matf.bg.ac.rs/software/
4. Biere, A.: Picosat version 535. Solver description. SAT Competition (2007)
5. Bregman, D.R.,Mitchell, D.G.: The SAT SolverMXC, version 0.75. Solver description. SAT Race Competition (2008)
6. Breiman, L.: Bagging Predictors. Machine Learning 24(2), 123-140 (1996)
7. Dequen, G., Dubois, O.: Dubois. kcnfs. Solver description. SAT Competition (2007)
8. Gomes, C.P., Selman, B.: Algorithm Portfolios. Artificial Intelligence 126(1-2), 43-62(2001)
9. Hamerly, G., Elkan, C.: Learning the K in K-Means. In: NIPS (2003)
10. Heule, M., Dufour, M., van Zwieten, J.E., van Maaren, H.: March eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 345-359. Springer, Heidelberg (2005)
11. Hoos, H.H.: Adaptive Novelty+: Novelty+ with adaptive noise. In: AAAI (2002)
12. Hutter, F., Tompkins, D., Hoos, H.H.: RSAPS: Reactive Scaling And Probabilistic Smoothing. In: CP (2002)
13. Hutter, F., Hamadi, Y.: Parameter Adjustment Based on Performance Prediction: Towards an Instance-Aware Problem Solver. Technical Report, MSR-TR-2005-125, Microsoft Research Cambridge (2005)
14. Hutter, F., Hamadi, Y., Hoos, H.H., Leyton-Brown, K.: Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 213-228. Springer, Heidelberg (2006)
15. Hutter, F., Hoos, H.H., Leyton-Brown, K., Stuetzle, T.: ParamILS: An Automatic Algorithm Configuration Framework. JAIR 36, 267-306 (2009)
16. Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC - Instance-Specific Algorithm Configuration. In: ECAI, pp. 751-756 (2010)
17. KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: Automatically Building Local Search SAT Solvers From Components. In: IJCAI (2009)
18. Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A Portfolio Approach to Algorithm Selection. In: IJCAI, pp. 1542-1543 (2003)
19. Li, C.M., Huang,W.Q.: G2WSAT: Gradient-based Greedy WalkSAT. In: Bacchus, F.,Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 158-172. Springer, Heidelberg (2005)
20. Nikolíc, M., Maríc, F., Janičíc, P.: Instance-Based Selection of Policies for SAT Solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 326-340. Springer, Heidelberg (2009)
21. O'Mahony, E., Hebrard, E., Holland, A., Nugent, C., O'Sullivan, B.: Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving. In: Irish Conference on Artificial Intelligence and Cognitive Science (2008)
22. Pham, D.N., Anbulagan: ranov. Solver description. SAT Competition (2007)
23. Pham, D.N., Gretton, C.: gnovelty+. Solver description. SAT Competition (2007)
24. Prestwich, S.: VW: Variable Weighting Scheme. In: SAT (2005)
25. SAT Competition, http://www.satcomptition.org
26. Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 6:1-6:25 (2009)
27. Silverthorn, B., Miikkulainen, R.: Latent Class Models for Algorithm Portfolio Methods. In: AAAI (2010)
28. Thornton, J., Pham, D.N., Bain, S., Ferreira, V.: Additive versus multiplicative clause weighting for SAT. In: PRICAI, pp. 405-416 (2008)
29. Tompkins, D.A.D., Hutter, F., Hoos, H.H.: saps. Solver description. SAT Competition (2007)
30. Wei,W., Li, C.M., Zhang, H.: Combining adaptive noise and promising decreasing variables in local search for SAT. Solver description. SAT Competition (2007)
31. Wei,W., Li, C.M., Zhang, H.: Deterministic and random selection of variables in local search for SAT. Solver description. SAT Competition (2007)
32. Wei,W., Li, C.M., Zhang, H.: adaptg2wsatp. Solver description. SAT Competition (2007)
33. Xu, L., Hoos, H.H., Leyton-Brown, K.: Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. In: AAAI (2010)
34. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla2009: an Automatic Algorithm Portfolio for SAT. Solver description. SAT Competition (2009)
35. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based Algorithm Selection for SAT. JAIR 32(1), 565-606 (2008)