Name
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. |
Year | Venue | Keywords |
|---|---|---|
2013 | IJCAI | effective portfolio builder,cost-sensitive hierarchical clustering model,algorithm portfolio,different solution approach,maxsat show,new method,concrete problem instance,combinatorial problem,new classifier |
Field | DocType | Citations |
Hierarchical clustering,Maximum satisfiability problem,Computer science,Algorithm,Portfolio,Schedule,Artificial intelligence,Classifier (linguistics),Machine learning | Conference | 29 |
PageRank | References | Authors |
0.95 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuri Malitsky | 1 | 278 | 17.79 |
| Ashish Sabharwal | 2 | 1063 | 70.62 |
| Horst Samulowitz | 3 | 316 | 26.05 |
| Meinolf Sellmann | 4 | 728 | 48.77 |