Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900310
DOI10.1007/b100482zbMath1152.68569OpenAlexW1508891358MaRDI QIDQ5900310
Yoav Shoham, Holger H. Hoos, Kevin Leyton-Brown, Alex Devkar, Eugene Nudelman
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100482
Related Items
ASlib: a benchmark library for algorithm selection ⋮ An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem ⋮ Portfolio theorem proving and prover runtime prediction for geometry ⋮ Learning dynamic algorithm portfolios ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ Hierarchical Hardness Models for SAT ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ The configurable SAT solver challenge (CSSC) ⋮ TTT plots: a perl program to create time-to-target plots ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ A computational complexity analysis of tunable type inference for Generic Universe Types ⋮ A self-adaptive multi-engine solver for quantified Boolean formulas ⋮ Machine learning for first-order theorem proving
Uses Software
