Algorithm survival analysis

DOI10.1007/978-3-642-02538-9_7MaRDI QIDQ3064519zbMATH OpenOpenAlexFDO

Authors Matteo Gagliolo, Catherine Legrand

Publication date 22 December 2010

Published in Experimental Methods for the Analysis of Optimization Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02538-9_7

zbMATH Keywords

algorithm performance

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Learning dynamic algorithm portfolios
• A PAC Approach to Application-Specific Algorithm Selection
• A PAC approach to application-specific algorithm selection
• The algorithm selection competitions 2015 and 2017
• Speeding up algorithm selection using average ranking and active testing by introducing runtime

Cited in

(9)

• A viability algorithm
• Algorithm portfolio selection as a bandit problem with unbounded losses
• Algorithm runtime prediction: methods \& evaluation
• Algorithmical and Computational Procedures for a Markov Model in Survival Analysis
• Learning dynamic algorithm portfolios
• Machine Learning: ECML 2004
• Speeding up algorithm selection using average ranking and active testing by introducing runtime
• A PAC approach to application-specific algorithm selection
• Automatically improving the anytime behaviour of optimisation algorithms

Describes a project that uses

Uses Software

• SATzilla

This page was built for publication: Algorithm survival analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064519)