Latent class models for algorithm portfolio methods

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 167-172

  Silverthorn, Bryan ^a   Miikkulainen, Risto ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ALGORITHM PORTFOLIOS; COMPUTATIONAL RESOURCES; LATENT CLASS MODEL; MIXTURE OF MULTINOMIAL DISTRIBUTION; MULTINOMIAL DISTRIBUTIONS; PERFORMANCE PREDICTION; PROBLEM INSTANCES; SPECIFIC PROBLEMS;

MIXTURES;

EID: 77958566744     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Biere, A.; Cimatti, A.; Clarke, E. M.; Fujita, M.; and Zhu, Y. 1999. Symbolic Model Checking using SAT procedures instead of BDDs. In ACM/IEEE Design Autom. Conference. Bishop, C. M. 2006. Pattern Recognition and Machine Learning.
2. Cicirello, V., and Smith, S. 2005. The Max K-Armed Bandit: a New Model for Exploration Applied to Search Heuristic Selection. In AAAI.
3. DeGroot, M. H. 1970. Optimal Statistical Decisions.
4. Doyle, G., and Elkan, C. 2009. Accounting for Word Bursti-ness in Topic Models. In ICML.
5. Elkan, C. 2006. Clustering Documents with an Exponential-Family Approximation of the Dirichlet Compound Multinomial Distribution. In ICML.
6. Gagliolo, M., and Schmidhuber, J. 2006. Learning dynamic algorithm portfolios. AMAI.
7. Gomes, C, and Selman, B. 2001. Algorithm portfolios. AI. Gomes, C. P.; Kautz, H.; Sabharwal, A.; and Selman, B. 2007. Satisfiability Solvers.
8. Horvitz, E.; Ruan, Y.; Gomes, C. P.; Kautz, H. A.; Selman, B.; and Chickering, D. M. 2001. A Bayesian Approach to Tackling Hard Computational Problems. In UAI.
9. Huberman, B.; Lukose, R.; and Hogg, T. 1997. Economics Approach to Hard Computational Problems. Science.
10. Katz, S. 1996. Distribution of content words and phrases in text and language modelling. NLE.
11. Kautz, H., and Selman, B. 1992. Planning as Satisfiability. In ECA1.
12. Kautz, H., and Selman, B. 2007. The state of SAT. DAM.
13. KhudaBukhsh, A.; Xu, L.; Hoos, H.; and Leyton-Brown, K. 2009. SATenstein: Automatically Building Local Search SAT Solvers From Components. In IJCAI.
14. Madsen, R. E.; Kauchak, D.; and Elkan, C. 2005. Modeling Word Burstiness Using the Dirichlet Distribution. In ICML.
15. McLachlan, G., and Peel, D. 2004. Finite Mixture Models.
16. Nudelman, E.; Leyton-Brown, K.; Hoos, H. H.; Devkar, A.; and Shoham, Y. 2004. Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. In CP.
17. Roberts, M., and Howe, A. 2006. Directing a Portfolio with Learning. In AAAI.
18. Streeter, M.; Golovin, D.; and Smith, S. F. 2007. Combining Multiple Heuristics Online. In AAAI.
19. Wallach, H. 2008. Structured Topic Models for Language. Ph.D. Dissertation, University of Cambridge.
20. Wood, R. G., and Rutenbar, R. A. 1997. FPGA Routing and Routability Estimation Via Boolean Satisfiability. In Int. Symposium on Field-Programmable Gate Arrays.
21. Xu, L.; Hutter, F; Hoos, H. H.; and Leyton-Brown, K. 2008. SATzilla: Portfolio-based Algorithm Selection for SAT. JA1R.
22. Xu, L.; Hutter, F; Hoos, H.; and Leyton-Brown, K. 2009. SATzilla2009: an Automatic Algorithm Portfolio for SAT. In SAT Competition 2009.