ECAI
2010
Springer
14 years 20 days ago
2010
Springer
-Order Abstractions for the Pancake Problem Malte Helmert and Gabriele R
AAAI
2008
14 years 1 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...