Paramils

swMATH678MaRDI QIDQ13432FDOQ13432

Author name not available (Why is that?)

Described by source

• ParamILS: An Automatic Algorithm Configuration Framework

Cited In (78)

• Methods for improving the efficiency of swarm optimization algorithms. A survey
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• meSAT: multiple encodings of CSP to SAT
• 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
• SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
• ASlib: a benchmark library for algorithm selection
• Effective learning hyper-heuristics for the course timetabling problem
• 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
• MaLeS: a framework for automatic tuning of automated theorem provers
• A methodology for determining an effective subset of heuristics in selection hyper-heuristics
• Markov chain methods for the bipartite Boolean quadratic programming problem
• Captain Jack: New Variable Selection Heuristics in Local Search for SAT
• 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
• Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
• Autonomous operator management for evolutionary algorithms
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• Tuning metaheuristics. A machine learning Perspective
• A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
• aspeed: Solver scheduling via answer set programming
• 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
• Automatic construction of optimal static sequential portfolios for AI planning and beyond
• A survey of adaptive large neighborhood search algorithms and applications
• Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
• The voice of optimization
• Evolution-inspired local improvement algorithm solving orienteering problem
• Cooperative parallel SAT local search with path relinking
• Measuring instance difficulty for combinatorial optimization problems
• Tuning BARON using derivative-free optimization algorithms
• The consultation timetabling problem at Danish high schools
• Pitfalls and Best Practices in Algorithm Configuration
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• An ant colony optimization approach for the multidimensional knapsack problem
• MultiETSC: automated machine learning for early time series classification
• 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
• 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
• Exploring Hyper-heuristic Methodologies with Genetic Programming
• 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
• The \textsc{MergeSat} solver
• Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches
• Escaping local minima with local derivative-free methods: a numerical investigation
• Benchmark and Survey of Automated Machine Learning Frameworks
• Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
• Boosting evolutionary algorithm configuration
• 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
• SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
• Generation techniques for linear programming instances with controllable properties
• Capping methods for the automatic configuration of optimization algorithms
• The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
• Reference point based archived many objective simulated annealing

This page was built for software: Paramils