The following pages link to Holger H. Hoos (Q98777):
Displaying 40 items.
- ASlib: A benchmark library for algorithm selection (Q98782) (← links)
- (Q286386) (redirect page) (← links)
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q1581848) (← links)
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT (Q1606317) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- A note on improving the performance of approximation algorithms for radiation therapy (Q1944893) (← links)
- MultiETSC: automated machine learning for early time series classification (Q2066661) (← links)
- VPint: value propagation-based spatial interpolation (Q2097440) (← links)
- Efficient local search for pseudo Boolean optimization (Q2118314) (← links)
- A survey on semi-supervised learning (Q2303675) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
- (Q2726305) (← links)
- (Q2749854) (← links)
- (Q2749862) (← links)
- (Q2776576) (← links)
- <tt>claspfolio</tt>2: Advances in Algorithm Selection for Answer Set Programming (Q2931265) (← links)
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT (Q3007692) (← links)
- Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches (Q3064530) (← links)
- Hierarchical Hardness Models for SAT (Q3523084) (← links)
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms (Q3524243) (← links)
- (Q3624141) (← links)
- ParamILS: An Automatic Algorithm Configuration Framework (Q3651487) (← links)
- (Q4414682) (← links)
- (Q4414683) (← links)
- (Q4495193) (← links)
- aspeed: Solver scheduling via answer set programming (Q4592974) (← links)
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT (Q4930595) (← links)
- (Q5398056) (← links)
- (Q5472387) (← links)
- Theory and Applications of Satisfiability Testing (Q5714764) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897207) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900310) (← links)
- Speeding up neural network robustness verification via algorithm configuration and an optimised mixed integer linear programming solver portfolio (Q6097125) (← links)
