Search Results for author: Yuri Malitsky

Found 4 papers, 1 papers with code

ASlib: A Benchmark Library for Algorithm Selection

2 code implementations8 Jun 2015 Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri Malitsky, Alexandre Frechette, Holger Hoos, Frank Hutter, Kevin Leyton-Brown, Kevin Tierney, Joaquin Vanschoren

To address this problem, we introduce a standardized format for representing algorithm selection scenarios and a repository that contains a growing number of data sets from the literature.

Transformation-based Feature Computation for Algorithm Portfolios

no code implementations10 Jan 2014 Barry Hurley, Serdar Kadioglu, Yuri Malitsky, Barry O'Sullivan

For a portfolio approach to be effective there are two crucial conditions that must be met.

DASH: Dynamic Approach for Switching Heuristics

no code implementations17 Jul 2013 Giovanni Di Liberto, Serdar Kadioglu, Kevin Leo, Yuri Malitsky

Complete tree search is a highly effective method for tackling MIP problems, and over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems.

Proteus: A Hierarchical Portfolio of Solvers and Transformations

no code implementations24 Jun 2013 Barry Hurley, Lars Kotthoff, Yuri Malitsky, Barry O'Sullivan

In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common.

Cannot find the paper you are looking for? You can Submit a new open access paper.