Pages that link to "Item:Q5958199"
From MaRDI portal
The following pages link to Disjoint pattern database heuristics (Q5958199):
Displaying 18 items.
- On the abstraction method for the container relocation problem (Q342301) (← links)
- Learning heuristic functions for large state spaces (Q420796) (← links)
- 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)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- Anytime pack search (Q2311238) (← links)
- Probably bounded suboptimal heuristic search (Q2321255) (← links)
- Heuristics as Markov chains (Q2350029) (← links)
- Duality in permutation state spaces and the dual search algorithm (Q2389626) (← links)
- Incremental beam search (Q2445330) (← links)
- Maximizing over multiple pattern databases speeds up heuristic search (Q2457594) (← links)
- Breadth-first heuristic search (Q2457631) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation (Q3072379) (← links)
- Fast Directed Model Checking Via Russian Doll Abstraction (Q5458328) (← links)
- Heuristically ordered search in state graphs (Q6602248) (← links)
