"Recursive Best-First Search with Bounded Overhead."

Matthew Hatem, Scott Kiesel, Wheeler Ruml (2015)

> Home

Details and statistics

DOI: 10.1609/AAAI.V29I1.9352

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/HatemKR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/HatemKR15
Matthew Hatem, Scott Kiesel, Wheeler Ruml:
Recursive Best-First Search with Bounded Overhead. AAAI 2015: 1151-1157

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.