"Computing Perfect Heuristics in Polynomial Time: On Bisimulation and ..."

Raz Nissim, Jörg Hoffmann, Malte Helmert (2011)

> Home

Details and statistics

DOI: 10.5591/978-1-57735-516-8/IJCAI11-331

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ijcai/NissimHH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/NissimHH11
Raz Nissim, Jörg Hoffmann, Malte Helmert:
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI 2011: 1983-1990

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.