The following pages link to Paramils (Q13432):
Displaying 50 items.
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- MaLeS: a framework for automatic tuning of automated theorem provers (Q286787) (← links)
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- \textsc{Alors}: an algorithm recommender system (Q511788) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning (Q647446) (← links)
- Poisson dependency networks: gradient boosted models for multivariate count data (Q747270) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- Tuning metaheuristics. A machine learning Perspective (Q1012715) (← links)
- Effect of transformations of numerical parameters in automatic algorithm configuration (Q1634780) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities (Q1652634) (← links)
- ALIAS: a modular tool for finding backdoors for SAT (Q1656599) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- On the impact of configuration on abstract argumentation automated reasoning (Q1687275) (← links)
- Exploring variable neighborhood search for automatic algorithm configuration (Q1687671) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Optimisation of interacting particle systems for rare event estimation (Q1800121) (← links)
- Methods for improving the efficiency of swarm optimization algorithms. A survey (Q1982839) (← links)
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms (Q2029299) (← links)
- Real-time solving of computationally hard problems using optimal algorithm portfolios (Q2043446) (← links)
- The voice of optimization (Q2051238) (← links)
- Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
- MultiETSC: automated machine learning for early time series classification (Q2066661) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← links)
- PyDGGA: distributed GGA for automatic configuration (Q2118281) (← links)
- The \textsc{MergeSat} solver (Q2118329) (← links)
- Boosting evolutionary algorithm configuration (Q2163844) (← links)
- Model-based algorithm configuration with adaptive capping and prior distributions (Q2170183) (← links)
- Learning pseudo-backdoors for mixed integer programs (Q2170189) (← links)
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
- Reference point based archived many objective simulated annealing (Q2200621) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- A novel hybrid PSO-based metaheuristic for costly portfolio selection problems (Q2241553) (← links)
- Automatically improving the anytime behaviour of optimisation algorithms (Q2256321) (← links)
- An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
- Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
