Automatic construction of parallel portfolios via algorithm configuration
DOI10.1016/J.ARTINT.2016.05.004zbMATH Open1404.68144OpenAlexW2398436144WikidataQ59585836 ScholiaQ59585836MaRDI QIDQ511786FDOQ511786
Authors: Holger H. Hoos, Torsten Schaub, Marius Lindauer, Kevin Leyton-Brown 
Publication date: 22 February 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1887/58569
Recommendations
algorithm configurationalgorithm portfoliosautomated parallelizationparallel SAT solvingprogramming by optimization
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) General topics in the theory of algorithms (68W01)
Cites Work
- ManySAT: a parallel SAT solver
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Paramils: an automatic algorithm configuration framework
- SATenstein: automatically building local search SAT solvers from components
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Theory and Applications of Satisfiability Testing
- SATzilla: portfolio-based algorithm selection for SAT
- Algorithm portfolios
- Learning dynamic algorithm portfolios
- Multi-threaded ASP solving with clasp
- Stochastic local search. Foundations and applications.
- Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
- Learning parallel portfolios of algorithms
- Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings
- Captain Jack: new variable selection heuristics in local search for SAT
- Contrasat -- a contrarian SAT solver
- HordeSat: a massively parallel portfolio SAT solver
Cited In (8)
- How we designed winning algorithms for abstract argumentation and which insight we attained
- HordeSat: a massively parallel portfolio SAT solver
- The algorithm selection competitions 2015 and 2017
- Paracoherent answer set computation
- A review of literature on parallel constraint solving
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- Learning parallel portfolios of algorithms
- ManySAT: a parallel SAT solver
Uses Software
This page was built for publication: Automatic construction of parallel portfolios via algorithm configuration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511786)
