What makes some POMDP problems easy to approximate?

[DBLP_Link] [Online_Version] CitedBy 11

Year: 2007
In Proceedings: NIPS

Authors:

David Hsu

(Associate Professor, Department of Computer Science)

H-index: 13; Papers: 27; Citation: 1229 [FOAF]

Homepage: http://robotics.stanford.edu/~dyhsu/

Expertise: Data Compression / Arithmetic Coding; Mobile Robot / Hybrid Control;

Wee Sun Lee

(Associate Professor, Department of Computer Science Computing 1 National University of Singapore)

H-index: 18; Papers: 53; Citation: 2494 [FOAF]

Homepage: http://www.comp.nus.edu.sg/~leews/

Expertise: Machine Learning; Information Retrieval / Probabilistic Indexing; Data Compression / Arithmetic Coding; Web Mining; Learning Search Control Rules / Explanation-based Approach;

Nan Rong

H-index: 2; Papers: 2; Citation: 19 [FOAF]

Expertise: Machine Learning;

David Hsu, Wee Sun Lee, Nan Rong. What makes some POMDP problems easy to approximate?. In Proceedings of NIPS'2007.

Other Format:

LNCS: [Top]
Hsu, D., Lee, W.S., Rong, N.: What makes some POMDP problems easy to approximate?. In NIPS(2007)

IEEE:
D. Hsu, W.S. Lee, and N. Rong, "What makes some POMDP problems easy to approximate?", in Proc. NIPS, 2007.

ACM:
Hsu, D., Lee, W.S., and Rong, N. What makes some POMDP problems easy to approximate?. In Proceedings of NIPS. 2007.

Latex:
@INPROCEEDINGS{ hsu:what, AUTHOR = "David Hsu and Wee Sun Lee and Nan Rong", TITLE = "What makes some POMDP problems easy to approximate?", booktitle = "NIPS'07", PAGES = {-1--1}, YEAR = {2007} }

Search it by Google