Pages that link to "Item:Q2457594"
From MaRDI portal
The following pages link to Maximizing over multiple pattern databases speeds up heuristic search (Q2457594):
Displaying 9 items.
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- New methods for proving the impossibility to solve problems through reduction of problem spaces (Q693286) (← links)
- Optimal Sokoban solving using pattern databases with specific domain knowledge (Q899157) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Heuristics as Markov chains (Q2350029) (← links)
- Duality in permutation state spaces and the dual search algorithm (Q2389626) (← links)
- Maximizing over multiple pattern databases speeds up heuristic search (Q2457594) (← links)
- Merge-and-Shrink Abstraction (Q3189651) (← links)
- Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
