Algorithm portfolios
From MaRDI portal
Publication:5940819
DOI10.1016/S0004-3702(00)00081-3zbMath0969.68047OpenAlexW2914775474MaRDI QIDQ5940819
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00081-3
Related Items (42)
Portfolio approaches for constraint optimization problems ⋮ ASlib: a benchmark library for algorithm selection ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ DASH: dynamic approach for switching heuristics ⋮ Variable ordering for decision diagrams: a portfolio approach ⋮ Learning parallel portfolios of algorithms ⋮ A study of mechanisms for improving robotic group performance ⋮ A competitive and cooperative approach to propositional satisfiability ⋮ A review of literature on parallel constraint solving ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ Planning as satisfiability: heuristics ⋮ SUNNY: a Lazy Portfolio Approach for Constraint Solving ⋮ Learning dynamic algorithm portfolios ⋮ Search methods for tile sets in patterned DNA self-assembly ⋮ Parallel Logic Programming: A Sequel ⋮ Algorithm unions for solving discrete optimization problems ⋮ aspeed: Solver scheduling via answer set programming ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Automatic construction of optimal static sequential portfolios for AI planning and beyond ⋮ Interruptible algorithms for multiproblem solving ⋮ Algorithms and mechanisms for procuring services with uncertain durations using redundancy ⋮ On algorithm portfolios and restart strategies ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ SUNNY-CP and the MiniZinc challenge ⋮ A machine learning system to improve the performance of ASP solving based on encoding selection ⋮ Unnamed Item ⋮ APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ \textsc{Alors}: an algorithm recommender system ⋮ Multi-threaded ASP solving with clasp ⋮ Empirical software metrics for benchmarking of verification tools ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem ⋮ Real-time solving of computationally hard problems using optimal algorithm portfolios ⋮ A self-adaptive multi-engine solver for quantified Boolean formulas ⋮ Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly ⋮ Item response theory in AI: analysing machine learning classifiers at the instance level ⋮ The algorithm selection competitions 2015 and 2017 ⋮ Graph coloring by multiagent fusion search ⋮ Optimal feedback control in first-passage resetting ⋮ Optimizing Noisy Complex Systems Liable to Failure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal speedup of Las Vegas algorithms
- Embedding partial Steiner triple systems is NP-complete
- A method for obtaining randomized algorithms with small tail probabilities
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Critical behavior in the computational cost of satisfiability testing
- The Non-Existence of Finite Projective Planes of Order 10
- New methods to color the vertices of a graph
This page was built for publication: Algorithm portfolios
