SATenstein
From MaRDI portal
Software:26138
swMATH14233MaRDI QIDQ26138FDOQ26138
Author name not available (Why is that?)
Cited In (16)
- A unified ant colony optimization algorithm for continuous optimization
- Automatic algorithm design for hybrid flowshop scheduling problems
- MaxSAT by improved instance-specific algorithm configuration
- Revisiting simulated annealing: a component-based analysis
- ParamILS: An Automatic Algorithm Configuration Framework
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT
- DASH: dynamic approach for switching heuristics
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- On the impact of the performance metric on efficient algorithm configuration
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
- Capping methods for the automatic configuration of optimization algorithms
- The configurable SAT solver challenge (CSSC)
- Automatic construction of parallel portfolios via algorithm configuration
- Automatically improving the anytime behaviour of optimisation algorithms
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
This page was built for software: SATenstein