The following pages link to (Q3624141):
Displaying 50 items.
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- Algorithm portfolios for noisy optimization (Q276539) (← links)
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- Automated theorem proving in GeoGebra: current achievements (Q286780) (← links)
- MaLeS: a framework for automatic tuning of automated theorem provers (Q286787) (← links)
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem (Q296973) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
- Benchmarking a model checker for algorithmic improvements and tuning for performance (Q453484) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- \textsc{Alors}: an algorithm recommender system (Q511788) (← links)
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- Empirical software metrics for benchmarking of verification tools (Q526771) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- Practical performance models of algorithms in evolutionary program induction and other domains (Q622115) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- On the impact of configuration on abstract argumentation automated reasoning (Q1687275) (← links)
- Propagation based local search for bit-precise reasoning (Q1688546) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- Scalable Gaussian process-based transfer surrogates for hyperparameter optimization (Q1707465) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Synergies between operations research and data mining: the emerging use of multi-objective approaches (Q1926877) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610) (← links)
- The voice of optimization (Q2051238) (← links)
- Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma (Q2055544) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
- MedleySolver: online SMT algorithm selection (Q2118336) (← links)
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving (Q2128804) (← links)
- Variable ordering for decision diagrams: a portfolio approach (Q2152280) (← links)
- Algorithm selection for the team orienteering problem (Q2163778) (← links)
- Boosting evolutionary algorithm configuration (Q2163844) (← links)
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- Iterative-deepening search with on-line tree size prediction (Q2248554) (← links)
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
- Solving SAT in a distributed cloud: a portfolio approach (Q2299084) (← links)
- Item response theory in AI: analysing machine learning classifiers at the instance level (Q2321286) (← links)
- The algorithm selection competitions 2015 and 2017 (Q2321293) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
