Cited in
(only showing first 100 items - show all)- Featuretools
- IDPDraw
- HIBISCUS
- SUNNY
- weightedHypervolume
- auto-sklearn
- RoBO
- BOHB
- CCLS
- CCEHC
- Autotune
- Cognito
- ExploreKit
- AutoFolio
- DACBench
- GenericWrapper4AC
- HPOlib
- AIspace
- Sparrow2Riss
- MachSMT
- MOMBI
- New local search methods for partial MaxSAT
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- Exploring hyper-heuristic methodologies with genetic programming
- Boosting evolutionary algorithm configuration
- Online speedup learning for optimal planning
- Metaheuristics for Score-and-Search Bayesian Network Structure Learning
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- A survey of adaptive large neighborhood search algorithms and applications
- Learning pseudo-backdoors for mixed integer programs
- Model-based algorithm configuration with adaptive capping and prior distributions
- On the importance of domain model configuration for automated planning engines
- On the impact of the performance metric on efficient algorithm configuration
- A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
- Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization
- The voice of optimization
- Cooperative parallel SAT local search with path relinking
- Evolution-inspired local improvement algorithm solving orienteering problem
- Measuring instance difficulty for combinatorial optimization problems
- AlphaD3M
- Tuning BARON using derivative-free optimization algorithms
- Betty
- OOESAlgorithm.jl
- HybridTuner
- Lash
- MPILS
- Adaptive-Cutsel-MILP
- Arg2P
- PyDGGA
- The consultation timetabling problem at Danish high schools
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
- Generation techniques for linear programming instances with controllable properties
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- An ant colony optimization approach for the multidimensional knapsack problem
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning
- MultiETSC: automated machine learning for early time series classification
- Capping methods for the automatic configuration of optimization algorithms
- On the impact of configuration on abstract argumentation automated reasoning
- Exploring variable neighborhood search for automatic algorithm configuration
- emili
- SMAC3
- pSMAC
- ACVIZ
- CAPOPT
- HHBQP
- Sequential model-based parameter optimization: an experimental investigation of automated and interactive approaches
- The configurable SAT solver challenge (CSSC)
- The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
- \textsc{Alors}: an algorithm recommender system
- Automatic construction of parallel portfolios via algorithm configuration
- Automatically improving the anytime behaviour of optimisation algorithms
- ALIAS: a modular tool for finding backdoors for SAT
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- Efficient benchmarking of algorithm configurators via model-based surrogates
- MO-ParamILS
- NeuroSAT
- The \textsc{MergeSat} solver
- Reference point based archived many objective simulated annealing
- SpyBug: automated bug detection in the configuration space of SAT solvers
- aspeed: solver scheduling via answer set programming
- NetPyNE
- Methods for improving the efficiency of swarm optimization algorithms. A survey
- Captain Jack: new variable selection heuristics in local search for SAT
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Pitfalls and best practices in algorithm configuration
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- meSAT: multiple encodings of CSP to SAT
- Escaping local minima with local derivative-free methods: a numerical investigation
- Automatic algorithm design for hybrid flowshop scheduling problems
- SATenstein: automatically building local search SAT solvers from components
- MaxSAT by improved instance-specific algorithm configuration
- OptiLog: a framework for SAT-based systems
- PyDGGA: distributed GGA for automatic configuration
- ASlib: a benchmark library for algorithm selection
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Effective learning hyper-heuristics for the course timetabling problem
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- The complexity of probabilistic lobbying
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
This page was built for software: Paramils
