Paramils
From MaRDI portal
Software:13432
No author found.
Related Items (78)
The consultation timetabling problem at Danish high schools ⋮ ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ MaxSAT by improved instance-specific algorithm configuration ⋮ ASlib: a benchmark library for algorithm selection ⋮ MaLeS: a framework for automatic tuning of automated theorem provers ⋮ Effective learning hyper-heuristics for the course timetabling problem ⋮ Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming ⋮ Effect of transformations of numerical parameters in automatic algorithm configuration ⋮ SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers ⋮ Online Speedup Learning for Optimal Planning ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ Best practices for comparing optimization algorithms ⋮ New local search methods for partial MaxSAT ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities ⋮ ALIAS: a modular tool for finding backdoors for SAT ⋮ Boosting evolutionary algorithm configuration ⋮ A Lagrangian propagator for artificial neural networks in constraint programming ⋮ The complexity of probabilistic lobbying ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ Model-based algorithm configuration with adaptive capping and prior distributions ⋮ Learning pseudo-backdoors for mixed integer programs ⋮ Autonomous operator management for evolutionary algorithms ⋮ Decomposition-based algorithms for the crew scheduling and routing problem in road restoration ⋮ 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 ⋮ Escaping local minima with local derivative-free methods: a numerical investigation ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ Exploring variable neighborhood search for automatic algorithm configuration ⋮ aspeed: Solver scheduling via answer set programming ⋮ Automatic construction of optimal static sequential portfolios for AI planning and beyond ⋮ Reference point based archived many objective simulated annealing ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ Pitfalls and Best Practices in Algorithm Configuration ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ Generation techniques for linear programming instances with controllable properties ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Metaheuristics for Score-and-Search Bayesian Network Structure Learning ⋮ Methods for improving the efficiency of swarm optimization algorithms. A survey ⋮ Captain Jack: New Variable Selection Heuristics in Local Search for SAT ⋮ The configurable SAT solver challenge (CSSC) ⋮ CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability ⋮ A novel hybrid PSO-based metaheuristic for costly portfolio selection problems ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ \textsc{Alors}: an algorithm recommender system ⋮ Star-topology decoupled state space search ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ Markov chain methods for the bipartite Boolean quadratic programming problem ⋮ A methodology for determining an effective subset of heuristics in selection hyper-heuristics ⋮ Automatically improving the anytime behaviour of optimisation algorithms ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT ⋮ An ant colony optimization approach for the multidimensional knapsack problem ⋮ Tuning BARON using derivative-free optimization algorithms ⋮ Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms ⋮ Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ Optimisation of interacting particle systems for rare event estimation ⋮ Real-time solving of computationally hard problems using optimal algorithm portfolios ⋮ Tuning metaheuristics. A machine learning Perspective ⋮ The voice of optimization ⋮ Poisson dependency networks: gradient boosted models for multivariate count data ⋮ Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers ⋮ SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers ⋮ Cooperative parallel SAT local search with path relinking ⋮ MultiETSC: automated machine learning for early time series classification ⋮ Exploring Hyper-heuristic Methodologies with Genetic Programming ⋮ Benchmark and Survey of Automated Machine Learning Frameworks ⋮ meSAT: multiple encodings of CSP to SAT ⋮ OptiLog: a framework for SAT-based systems ⋮ PyDGGA: distributed GGA for automatic configuration ⋮ The \textsc{MergeSat} solver
This page was built for software: Paramils
