Learning parallel portfolios of algorithms

DOI10.1007/s10472-007-9050-9zbMath1121.68095OpenAlexW2048923623MaRDI QIDQ2643151

Shlomo Zilberstein, Marek Petrik

Publication date: 23 August 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-007-9050-9

zbMATH Keywords

Combinatorial optimizationAlgorithm portfoliosResource bounded reasoning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms in computer science (68W99)

Related Items (5)

Learning parallel portfolios of algorithms ⋮ Learning dynamic algorithm portfolios ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ Real-time solving of computationally hard problems using optimal algorithm portfolios

Uses Software

• SatEx
• Walksat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic composition of information retrieval techniques
• Learning parallel portfolios of algorithms
• Algorithm portfolios

This page was built for publication: Learning parallel portfolios of algorithms