SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios-Reference-Cited by-同舟云学术

SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios

Published:2013 Issue: Volume: Page:435-450
ISSN:0302-9743
Container-title:Advanced Information Systems Engineering
language:
Short-container-title:

Author:

Collautti Marco,Malitsky Yuri,Mehta Deepak,O’Sullivan Barry

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40994-3_28

Reference17 articles.

1. SAT Competition (2011), http://www.cril.univ-artois.fr/SAT11/

2. SAT Competitions, http://www.satcompetition.org/

3. Bensusan, H., Giraud-Carrier, C.: Casa Batlo is in Passeig de Gracia or landmarking the expertise space. In: ECML Workshop on Meta-Learning: Building Automatic Advice Strategies for Model Selection and Method Combination (2000)

4. Breiman, L.: Random forests. Machine Learning 45(1), 5–32 (2001)

5. Hamerly, G., Elkan, C.: Learning the k in k-means. In: NIPS (2003)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches;Journal of Heuristics;2023-01-09

2. Coevolutionary strategies at the collective level for improved generalism;Data-Centric Engineering;2023

3. Active Learning for SAT Solver Benchmarking;Tools and Algorithms for the Construction and Analysis of Systems;2023

4. Cross-domain Algorithm Selection: Algorithm Selection across Selection Hyper-heuristics;2022 IEEE Symposium Series on Computational Intelligence (SSCI);2022-12-04

5. Chapter 12. Automated Configuration and Selection of SAT Solvers;Frontiers in Artificial Intelligence and Applications;2021-02-02