Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Raz Nissim, Jörg Hoffmann, Malte Helmert. Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. In Toby Walsh, editor, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011. pages 1983-1990, IJCAI/AAAI, 2011. [doi]

This author has not been identified. Look up 'Raz Nissim' in GoogleThis author has not been identified. Look up 'Jörg Hoffmann' in GoogleThis author has not been identified. Look up 'Malte Helmert' in Google

runs on WebDSL