The following pages link to (Q5715685):
Displaying 17 items.
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- Optimal Sokoban solving using pattern databases with specific domain knowledge (Q899157) (← links)
- Optimal admissible composition of abstraction heuristics (Q991018) (← links)
- Symbolic perimeter abstraction heuristics for cost-optimal planning (Q1647507) (← links)
- An exact algorithm for the blocks relocation problem with new lower bounds (Q1654367) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Landmark-enhanced abstraction heuristics (Q1761301) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← 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)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Merge-and-Shrink Abstraction (Q3189651) (← links)
- Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning (Q5026253) (← links)
- The compressed differential heuristic (Q5145426) (← links)