SATenstein: automatically building local search SAT solvers from components
From MaRDI portal
Publication:2634473
Recommendations
- Auto-Walksat: A self-tuning implementation of Walksat
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- SATzilla: portfolio-based algorithm selection for SAT
- The configurable SAT solver challenge (CSSC)
- Captain Jack: new variable selection heuristics in local search for SAT
Cites work
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 5510694 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Algorithm portfolios
- Autonomous operator management for evolutionary algorithms
- Captain Jack: new variable selection heuristics in local search for SAT
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Improving stochastic local search for SAT with a new probability distribution
- Learning dynamic algorithm portfolios
- Paramils: an automatic algorithm configuration framework
- SATzilla: portfolio-based algorithm selection for SAT
- Synthesis of efficient constraint-satisfaction programs
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(22)- On the impact of the performance metric on efficient algorithm configuration
- MaxSAT by improved instance-specific algorithm configuration
- Auto-Walksat: A self-tuning implementation of Walksat
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Captain Jack: new variable selection heuristics in local search for SAT
- Revisiting simulated annealing: a component-based analysis
- Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands
- A unified ant colony optimization algorithm for continuous optimization
- Targeted configuration of an SMT solver
- Itauto: An Extensible Intuitionistic SAT Solver
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- SATenstein
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
- SpyBug: automated bug detection in the configuration space of SAT solvers
- Evaluating the impact of grammar complexity in automatic algorithm design
- Automatic algorithm design for hybrid flowshop scheduling problems
- The configurable SAT solver challenge (CSSC)
- A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms
- Automatic construction of parallel portfolios via algorithm configuration
- Capping methods for the automatic configuration of optimization algorithms
- From fitness landscapes evolution to automatic local search algorithm generation
Describes a project that uses
Uses Software
This page was built for publication: SATenstein: automatically building local search SAT solvers from components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634473)
