Empirical hardness models

DOI10.1145/1538902.1538906zbMath1325.68110OpenAlexW2086886584WikidataQ60521670 ScholiaQ60521670MaRDI QIDQ3452218

Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham

Publication date: 11 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1538902.1538906

zbMATH Keywords

algorithm portfoliosruntime predictioncombinatorial auctionsempirical analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Online over time processing of combinatorial problems ⋮ Learning dynamic algorithm portfolios ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ Algorithms and mechanisms for procuring services with uncertain durations using redundancy ⋮ Metalearning and algorithm selection: progress, state of the art and introduction to the 2018 special issue ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ Generation techniques for linear programming instances with controllable properties ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem ⋮ Compact bidding languages and supplier selection for markets with economies of scale and scope ⋮ A PAC Approach to Application-Specific Algorithm Selection ⋮ A faster tree-decomposition based algorithm for counting linear extensions

This page was built for publication: Empirical hardness models