The following pages link to SATenstein (Q26138):
Displaying 16 items.
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Automatically improving the anytime behaviour of optimisation algorithms (Q2256321) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- A unified ant colony optimization algorithm for continuous optimization (Q2514761) (← links)
- On the impact of the performance metric on efficient algorithm configuration (Q2667810) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT (Q3007692) (← links)
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers (Q3453227) (← links)
- ParamILS: An Automatic Algorithm Configuration Framework (Q3651487) (← links)
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT (Q4930595) (← links)