scientific article
From MaRDI portal
Publication:3624141
zbMath1182.68272arXiv1111.2249MaRDI QIDQ3624141
Holger H. Hoos, Frank Hutter, Kevin Leyton-Brown, Lin Xu
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1111.2249
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
MaxSAT by improved instance-specific algorithm configuration ⋮ Algorithm portfolios for noisy optimization ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Autonomous operator management for evolutionary algorithms ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ Machine learning and logic: a new frontier in artificial intelligence ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ Parallel Logic Programming: A Sequel ⋮ 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 ⋮ Stochastic local search and parameters recommendation: a case study on flowshop problems ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Optimal decision trees for the algorithm selection problem: integer programming based approaches ⋮ 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 ⋮ Targeted configuration of an SMT solver ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ 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 ⋮ Hierarchical Hardness Models for SAT ⋮ Benchmarking a model checker for algorithmic improvements and tuning for performance ⋮ Unnamed Item ⋮ Unnamed Item ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ 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 ⋮ 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 ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Item response theory in AI: analysing machine learning classifiers at the instance level ⋮ The algorithm selection competitions 2015 and 2017 ⋮ 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 ⋮ On the hierarchical community structure of practical Boolean formulas ⋮ MedleySolver: online SMT algorithm selection
Uses Software
This page was built for publication:
