6 citations · 8 across the 6 of their papers we have counts for
6 papers · 1 filter
HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection
Lukas Fehring, Jonas Hanselle, Alexander Tornede
It is well known that different algorithms perform differently well on an instance of an algorithmic problem, motivating algorithm selection (AS): Given an instance of an algorithm…
Machine Learning for Online Algorithm Selection under Censored Feedback
Alexander Tornede, Viktor Bengs, Eyke Hüllermeier
In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best al…
Algorithm Selection on a Meta Level
Alexander Tornede, Lukas Gehring, Tanja Tornede +2
The problem of selecting an algorithm that appears most suitable for a specific instance of an algorithmic problem class, such as the Boolean satisfiability problem, is called inst…
Towards Meta-Algorithm Selection
Alexander Tornede, Marcel Wever, Eyke Hüllermeier
Instance-specific algorithm selection (AS) deals with the automatic selection of an algorithm from a fixed set of candidates most suitable for a specific instance of an algorithmic…
Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis
Alexander Tornede, Marcel Wever, Stefan Werner +2
Algorithm selection (AS) deals with the automatic selection of an algorithm from a fixed set of candidate algorithms most suitable for a specific instance of an algorithmic problem…
Extreme Algorithm Selection With Dyadic Feature Representation
Alexander Tornede, Marcel Wever, Eyke Hüllermeier
Algorithm selection (AS) deals with selecting an algorithm from a fixed set of candidate algorithms most suitable for a specific instance of an algorithmic problem, e.g., choosing…