SATzilla

swMATH6281MaRDI QIDQ18412

No author found.

Related Items (91)

MaxSAT by improved instance-specific algorithm configuration ⋮ Algorithm portfolios for noisy optimization ⋮ Portfolio approaches for constraint optimization problems ⋮ Heterogeneous heuristic optimisation and scheduling for first-order theorem proving ⋮ ASlib: a benchmark library for algorithm selection ⋮ Automated theorem proving in GeoGebra: current achievements ⋮ MaLeS: a framework for automatic tuning of automated theorem provers ⋮ URSA: A System for Uniform Reduction to SAT ⋮ An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem ⋮ Portfolio theorem proving and prover runtime prediction for geometry ⋮ Propositional SAT Solving ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ DASH: dynamic approach for switching heuristics ⋮ Optimal defense against election control by deleting voter groups ⋮ Variable ordering for decision diagrams: a portfolio approach ⋮ Towards objective measures of algorithm performance across instance space ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Impact of Community Structure on SAT Solver Performance ⋮ A review of literature on parallel constraint solving ⋮ Algorithm selection for the team orienteering problem ⋮ Boosting evolutionary algorithm configuration ⋮ Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ The complexity of probabilistic lobbying ⋮ Machine learning for mathematical software ⋮ SUNNY: a Lazy Portfolio Approach for Constraint Solving ⋮ Autonomous operator management for evolutionary algorithms ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ Guiding high-performance SAT solvers with unsat-core predictions ⋮ CrystalBall: gazing in the black box of SAT solving ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ Propagation based local search for bit-precise reasoning ⋮ aspeed: Solver scheduling via answer set programming ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Automatic construction of optimal static sequential portfolios for AI planning and beyond ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ Unnamed Item ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Complete Boolean satisfiability solving algorithms based on local search ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ Scalable Gaussian process-based transfer surrogates for hyperparameter optimization ⋮ Pitfalls and Best Practices in Algorithm Configuration ⋮ Benchmarking a model checker for algorithmic improvements and tuning for performance ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Local search for Boolean satisfiability with configuration checking and subscore ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ Captain Jack: New Variable Selection Heuristics in Local Search for SAT ⋮ Paracoherent answer set computation ⋮ The configurable SAT solver challenge (CSSC) ⋮ Metaheuristics ``In the large ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ \textsc{Alors}: an algorithm recommender system ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Star-topology decoupled state space search ⋮ Decision procedures. An algorithmic point of view ⋮ Iterative-deepening search with on-line tree size prediction ⋮ Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings ⋮ Empirical software metrics for benchmarking of verification tools ⋮ E-MaLeS 1.1 ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem ⋮ Boosting Local Search Thanks to cdcl ⋮ A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning ⋮ Algorithm Survival Analysis ⋮ On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem ⋮ A PAC Approach to Application-Specific Algorithm Selection ⋮ Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition ⋮ Efficiently Coupling the I-DLV Grounder with ASP Solvers ⋮ Solving SAT in a distributed cloud: a portfolio approach ⋮ The voice of optimization ⋮ Extreme Cases in SAT Problems ⋮ Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma ⋮ Efficiently Calculating Evolutionary Tree Measures Using SAT ⋮ Reconstruction of Z3’s Bit-Vector Proofs in HOL4 and Isabelle/HOL ⋮ Adaptive Constraint Satisfaction: The Quickest First Principle ⋮ 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 ⋮ meSAT: multiple encodings of CSP to SAT ⋮ Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness ⋮ Theorem proving as constraint solving with coherent logic ⋮ Machine learning for first-order theorem proving ⋮ ProCount: weighted projected model counting with graded project-join trees ⋮ MedleySolver: online SMT algorithm selection ⋮ Algorithm selection for dynamic symbolic execution: a preliminary study

This page was built for software: SATzilla