Algorithm portfolios
From MaRDI portal
Recommendations
- Algorithm Portfolios
- Learning dynamic algorithm portfolios
- scientific article; zbMATH DE number 2231119
- On algorithm portfolios and restart strategies
- 10.1162/153244303321897672
- Algorithms for solving financial portfolio design problems. Emerging research and opportunities
- Algorithm of optimal portfolio diversification
- scientific article; zbMATH DE number 6379404
- Algorithm portfolios for noisy optimization
Cites work
- A method for obtaining randomized algorithms with small tail probabilities
- Critical behavior in the computational cost of satisfiability testing
- Embedding partial Steiner triple systems is NP-complete
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- New methods to color the vertices of a graph
- Optimal speedup of Las Vegas algorithms
- The Non-Existence of Finite Projective Planes of Order 10
Cited in
(48)- A self-adaptive multi-engine solver for quantified Boolean formulas
- Graph coloring by multiagent fusion search
- 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
- Variable ordering for decision diagrams: a portfolio approach
- Interruptible algorithms for multiproblem solving
- Item response theory in AI: analysing machine learning classifiers at the instance level
- The algorithm selection competitions 2015 and 2017
- A study of mechanisms for improving robotic group performance
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- A unified framework for partial and hybrid search methods in constraint programming
- SATenstein: automatically building local search SAT solvers from components
- Learning parallel portfolios of algorithms
- A machine learning system to improve the performance of ASP solving based on encoding selection
- Algorithm portfolios for noisy optimization
- Portfolio approaches for constraint optimization problems
- ASlib: a benchmark library for algorithm selection
- SUNNY: a lazy portfolio approach for constraint solving
- Approximating the discrete resource sharing scheduling problem
- Synthesizing small and reliable tile sets for patterned DNA self-assembly
- DASH: dynamic approach for switching heuristics
- Planning as satisfiability: heuristics
- Search methods for tile sets in patterned DNA self-assembly
- Algorithm portfolio selection as a bandit problem with unbounded losses
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy
- A review of literature on parallel constraint solving
- aspeed: solver scheduling via answer set programming
- SUNNY-CP and the MiniZinc challenge
- Multi-threaded ASP solving with clasp
- scientific article; zbMATH DE number 7453125 (Why is no real title available?)
- Optimizing noisy complex systems liable to failure
- Automatic construction of parallel portfolios via algorithm configuration
- \textsc{Alors}: an algorithm recommender system
- Empirical software metrics for benchmarking of verification tools
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- Optimal feedback control in first-passage resetting
- Parallel Logic Programming: A Sequel
- Algorithm unions for solving discrete optimization problems
- On algorithm portfolios and restart strategies
- Unsatisfiability proofs for distributed clause-sharing SAT solvers
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
- Learning to branch: generalization guarantees and limits of data-independent discretization
- Frugal algorithm selection for combinatorial search
- A competitive and cooperative approach to propositional satisfiability
- Learning dynamic algorithm portfolios
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
This page was built for publication: Algorithm portfolios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940819)
