External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming

Jason Pazis, Ronald Parr. Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming. In Marie desJardins, Michael L. Littman, editors, Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2012, Bellevue, Washington, USA. pages 782-788, AAAI Press, 2013. [doi]

Authors

Jason Pazis

This author has not been identified. Look up 'Jason Pazis' in Google

Ronald Parr

This author has not been identified. Look up 'Ronald Parr' in Google
runs on