资源分类
》 资源 》论文》Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering

Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering

2019-11-11 | |  65 |   54 |   0
Abstract Different solution approaches for combinatorial problems often exhibit incomparable performance that depends on the concrete problem instance to be solved. Algorithm portfolios aim to combine the strengths of multiple algorithmic approaches by training a classifier that selects or schedules solvers dependent on the given instance. We devise a new classifier that selects solvers based on a cost-sensitive hierarchical clustering model. Experimental results on SAT and MaxSAT show that the new method outperforms the most effective portfolio builders to date.

上一篇：Target-Value Search Revisited

下一篇：On Computing Minimal Correction Subsets Joao Marques-Silva Federico Heras Mikolas Janota

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...