"Complexity of Stochastic Branch and Bound Methods for Belief Tree Search ..."

Christos Dimitrakakis (2010)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2010-03-03

- no documents available
- export record
  dblp key:
  - conf/icaart/Dimitrakakis10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icaart/Dimitrakakis10
Christos Dimitrakakis:
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning. ICAART (1) 2010: 259-264

a service of

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.