SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios
暂无分享,去创建一个
[1] Yuri Malitsky,et al. Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation , 2012, CPAIOR.
[2] Kevin Leyton-Brown,et al. SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..
[3] Greg Hamerly,et al. Learning the k in k-means , 2003, NIPS.
[4] Yuri Malitsky,et al. ISAC - Instance-Specific Algorithm Configuration , 2010, ECAI.
[5] Kevin Leyton-Brown,et al. Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors , 2012, SAT.
[6] Hilan Bensusan,et al. Casa Batlo is in Passeig de Gracia or landmarking the expertise space , 2000 .
[7] Christian J. Muise,et al. Probabilistically Estimating Backbones and Variable Bias: Experimental Overview , 2008, CP.
[8] Bart Selman,et al. Algorithm portfolios , 2001, Artif. Intell..
[9] Yuri Malitsky,et al. Feature Filtering for Instance-Specific Algorithm Configuration , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.
[10] Lars Kotthoff,et al. An evaluation of machine learning in algorithm selection for search problems , 2012, AI Commun..
[11] Luc Lamontagne,et al. Case-Based Reasoning Research and Development , 1997, Lecture Notes in Computer Science.
[12] T. W. Anderson,et al. Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes , 1952 .
[13] Risto Miikkulainen,et al. Latent class models for algorithm portfolio methods , 2010, AAAI 2010.
[14] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[15] Andrew W. Moore,et al. X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.
[16] Yoav Shoham,et al. Boosting as a Metaphor for Algorithm Design , 2003, CP.
[17] Yuri Malitsky,et al. Non-Model-Based Algorithm Portfolios for SAT , 2011, SAT.
[18] Joaquin Vanschoren,et al. EUROPEAN CONFERENCE ON MACHINE LEARNING AND PRINCIPLES AND PRACTICE OF KNOWLEDGE DISCOVERY IN DATABASES , 2012 .
[19] M. F.,et al. Bibliography , 1985, Experimental Gerontology.
[20] Yuri Malitsky,et al. Parallel SAT Solver Selection and Scheduling , 2012, CP.
[21] Hilan Bensusan,et al. Meta-Learning by Landmarking Various Learning Algorithms , 2000, ICML.
[22] Yuri Malitsky,et al. Algorithm Selection and Scheduling , 2011, CP.
[23] Barry O'Sullivan,et al. Adaptation in a CBR-Based Solver Portfolio for the Satisfiability Problem , 2012, ICCBR.
[24] Lior Rokach,et al. Clustering Methods , 2005, The Data Mining and Knowledge Discovery Handbook.
[25] Eoin O'Mahony,et al. Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving ? , 2008 .
[26] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[27] R. Geoff Dromey,et al. An algorithm for the selection problem , 1986, Softw. Pract. Exp..
[28] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[29] Kevin Leyton-Brown,et al. : The Design and Analysis of an Algorithm Portfolio for SAT , 2007, CP.
[30] Nicolas Beldiceanu,et al. 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) , 2012 .
[31] Luca Pulina,et al. A self-adaptive multi-engine solver for quantified Boolean formulas , 2009, Constraints.
[32] Yuri Malitsky,et al. Instance-specific algorithm configuration , 2014, Constraints.
[33] Jonathon Shlens,et al. A Tutorial on Principal Component Analysis , 2014, ArXiv.
[34] Sharad Malik,et al. Zchaff2004: An Efficient SAT Solver , 2004, SAT (Selected Papers.