Paramils
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- Revisiting simulated annealing: a component-based analysis
- MaLeS: a framework for automatic tuning of automated theorem provers
- 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
- Benchmark and survey of automated machine learning frameworks
- Tuning metaheuristics. A machine learning Perspective
- 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
- Hyperheuristics
- March_eq
- SatEx
- ParaDisEO
- GAPS
- OPNET
- UBCSAT
- LIBOPT
- 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
- JCell
- Algorithm 709
- Treengeling
- SATenstein
- ASlib
- E-MaLeS
- 2DCPackGen
- Spybug
- SpySMAC
- MAFRA
- Poisson dependency networks: gradient boosted models for multivariate count data
- satUZK
- Alors
- Hyperopt
- FrogCOL
- EasyAnalyzer
- SMAC
- WPM2
- Localizer++
- NILS
- Auto-WEKA
- CoQuiAAS
- lmPerm
- BPPLIB
- llama
- AClib
- abcdSAT
- aspeed
- COBAYN
- meSAT
- OpenTuner
This page was built for software: Paramils
