Optimization of heuristic search using recursive algorithm selection and reinforcement learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- 10.1162/1532443041827907
- A note on two problems in connexion with graphs
- Computing the shortest path: \(A^\ast\) search meets graph theory
- Engineering Highway Hierarchies
- Engineering Route Planning Algorithms
- Fast Routing in Road Networks with Transit Nodes
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Heuristic search in restricted memory
- Introduction to algorithms
- Learning dynamic algorithm portfolios
- Learning to select branching rules in the DPLL procedure for satisfiability
- Real-time heuristic search
- Shortest paths algorithms: Theory and experimental evaluation
Cited in
(4)
This page was built for publication: Optimization of heuristic search using recursive algorithm selection and reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647446)