SATenstein

swMATH14233MaRDI QIDQ26138FDOQ26138

Author name not available (Why is that?)

Described by source

• SATenstein: automatically building local search SAT solvers from components

Cited In (16)

• Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
• Captain Jack: new variable selection heuristics in local search for SAT
• 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
• 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
• 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
• Paramils: an automatic algorithm configuration framework
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems

This page was built for software: SATenstein