"Predicting the Size of Depth-First Branch and Bound Search Trees."

Levi H. S. Lelis, Lars Otten, Rina Dechter (2013)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2022-03-08

- view
  - electronic edition @ aaai.org (archived)
  - electronic edition @ ijcai.org (open access)
- export record
  dblp key:
  - conf/ijcai/LelisOD13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/LelisOD13
Levi H. S. Lelis, Lars Otten, Rina Dechter:
Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI 2013: 594-600

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.