SATzilla
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Beaver
- Hyperheuristics
- ManySAT
- March_eq
- MiniSat
- Paramils
- PYTHIA
- pSMAC
- MedleySolver
- GANAK
- UnitWalk
- Zchaff2004
- PLATYPUS
- MyPYTHIA
- SatEx
- GridSAT
- SATLIB
- UBCSAT
- FRODO__2
- Optimal defense against election control by deleting voter groups
- The complexity of probabilistic lobbying
- Machine learning for mathematical software
- QingTing1
- SAT competition
- Lparse
- On the impact of configuration on abstract argumentation automated reasoning
- Propagation based local search for bit-precise reasoning
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Scalable Gaussian process-based transfer surrogates for hyperparameter optimization
- Star-topology decoupled state space search
- Choco
- MiniZinc
- SPOT
- CDAOstore
- WEKA
- NeVer
- BerkMin
- Potassco
- PaMiraXT
- clasp
- gcl
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- NumberJack
- Glucose
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- irace
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- The voice of optimization
- Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma
- Runsolver
- Theorem proving as constraint solving with coherent logic
- ProCount: weighted projected model counting with graded project-join trees
- MedleySolver: online SMT algorithm selection
- Algorithm selection for dynamic symbolic execution: a preliminary study
- Cunf
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
- URBiVA
- Jerusat
- Variable ordering for decision diagrams: a portfolio approach
- QBFLIB
- Algorithm selection for the team orienteering problem
- Boosting evolutionary algorithm configuration
- MiniMaxSat
- Sugar
- Guiding high-performance SAT solvers with unsat-core predictions
- CrystalBall: gazing in the black box of SAT solving
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- GlueMiniSat
- BitBlaze
- SOCRATES
- Proteus
- CSP2SAT4J
- CryptoMiniSat
- Azucar
- Paracoherent answer set computation
- Metaheuristics ``In the large
- Iterative-deepening search with on-line tree size prediction
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Solving SAT in a distributed cloud: a portfolio approach
- Item response theory in AI: analysing machine learning classifiers at the instance level
- The algorithm selection competitions 2015 and 2017
- On the design of metaheuristics-based algorithm portfolios
- Compiling CP subproblems to MDDs and d-DNNFs
- ppfolio
- meSAT: multiple encodings of CSP to SAT
- Machine learning for first-order theorem proving
- claspfolio 2
- SIMPLY
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- A taxonomy of exact methods for partial Max-SAT
- Complete Boolean satisfiability solving algorithms based on local search
- QMDD
- pfolioUZK
- Sparrow2011
- RSat
- fzn2smt
- ODEXPERT
- SATenstein
- Portfolio theorem proving and prover runtime prediction for geometry
This page was built for software: SATzilla
