88 citations · 341 across the 16 of their papers we have counts for
5 papers · 1 filter
Algorithm Configuration: Learning policies for the quick termination of poor performers
Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle
One way to speed up the algorithm configuration task is to use short runs instead of long runs as much as possible, but without discarding the configurations that eventually do wel…
Generalizing Boolean Satisfiability III: Implementation
H. E. Dixon, M. L. Ginsberg, D. Hofer +2
This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern hi…
Generalizing Boolean Satisfiability II: Theory
H. E. Dixon, M. L. Ginsberg, E. M. Luks +1
This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of…
HyFlex: A Benchmark Framework for Cross-domain Heuristic Search
Edmund Burke, Tim Curtois, Matthew Hyde +2
Automating the design of heuristic search methods is an active research field within computer science, artificial intelligence and operational research. In order to make these meth…
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
H. E. Dixon, M. L. Ginsberg, A. J. Parkes
This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of m…