Combinatorial search from an energy perspective
From MaRDI portal
Publication:2419800
DOI10.1016/j.ipl.2019.04.002zbMath1478.68335OpenAlexW2943279409WikidataQ127951843 ScholiaQ127951843MaRDI QIDQ2419800
Mohamed Siala, Barry O'Sullivan
Publication date: 4 June 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://hal.laas.fr/hal-02120041/file/19-IPL.pdf
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Cites Work
- Algorithm runtime prediction: methods \& evaluation
- Optimal speedup of Las Vegas algorithms
- Probability distribution of solution time in GRASP: an experimental investigation
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
This page was built for publication: Combinatorial search from an energy perspective