swMATH678MaRDI QIDQ13432FDOQ13432
Author name not available (Why is that?)
Official website: http://www.cs.ubc.ca/labs/beta/Projects/ParamILS/
Cited In (only showing first 100 items - show all)
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Captain Jack: new variable selection heuristics in local search for SAT
- Methods for improving the efficiency of swarm optimization algorithms. A survey
- Automatic algorithm design for hybrid flowshop scheduling problems
- MO-ParamILS
- NeuroSAT
- OptiLog: a framework for SAT-based systems
- PyDGGA: distributed GGA for automatic configuration
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- The complexity of probabilistic lobbying
- Revisiting simulated annealing: a component-based analysis
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- Star-topology decoupled state space search
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Effect of transformations of numerical parameters in automatic algorithm configuration
- A Lagrangian propagator for artificial neural networks in constraint programming
- Optimisation of interacting particle systems for rare event estimation
- Best practices for comparing optimization algorithms
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Autonomous operator management for evolutionary algorithms
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- Poisson dependency networks: gradient boosted models for multivariate count data
- New local search methods for partial MaxSAT
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- Metaheuristics for Score-and-Search Bayesian Network Structure Learning
- Online speedup learning for optimal planning
- Boosting evolutionary algorithm configuration
- 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
- The voice of optimization
- Evolution-inspired local improvement algorithm solving orienteering problem
- Cooperative parallel SAT local search with path relinking
- Tuning BARON using derivative-free optimization algorithms
- Generation techniques for linear programming instances with controllable properties
- An ant colony optimization approach for the multidimensional knapsack problem
- MultiETSC: automated machine learning for early time series classification
- Capping methods for the automatic configuration of optimization algorithms
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning
- On the impact of configuration on abstract argumentation automated reasoning
- Exploring variable neighborhood search for automatic algorithm configuration
- emili
- SMAC3
- pSMAC
- ACVIZ
- CAPOPT
- HHBQP
- The configurable SAT solver challenge (CSSC)
- \textsc{Alors}: an algorithm recommender system
- Automatic construction of parallel portfolios via algorithm configuration
- Automatically improving the anytime behaviour of optimisation algorithms
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- Efficient benchmarking of algorithm configurators via model-based surrogates
- The \textsc{MergeSat} solver
- Reference point based archived many objective simulated annealing
- SpyBug: automated bug detection in the configuration space of SAT solvers
- 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
- SATenstein: automatically building local search SAT solvers from components
- MaxSAT by improved instance-specific algorithm configuration
- ASlib: a benchmark library for algorithm selection
- Effective learning hyper-heuristics for the course timetabling problem
- MaLeS: a framework for automatic tuning of automated theorem provers
- Tuning metaheuristics. A machine learning Perspective
- Exploring hyper-heuristic methodologies with genetic programming
- Hyperheuristics
- March_eq
- SatEx
- EasyLocal++
- SAT competition
- BG-WalkSAT
- PROXIMUS
- RPOLY
- SATzilla
- SPOT
- HyFlex
- CCGbank
- irace
- race
- ASPARTIX
- Gurobi Mex
- OPAL
- Runsolver
- Cunf
- D-FLAT
- BitBlaze
- Azucar
- URBiVA
- Proteus
- Sugar
- ACOTSP
- ppfolio
- claspfolio 2
- pfolioUZK
This page was built for software: Paramils
