ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Exponential bounds and stopping rules for MCMC and general Markov chains

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: I. Kontoyiannis Athens Univ of Econ & Business, Athens, Greece
L. A. Lastras-Montaño IBM TJ Watson Research Center, Yorktown Heights, NY
S. P. Meyn University of Ill at Urbana-Champaign, Urbana, IL
Published in:
· Proceeding
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-504-5 doi>10.1145/1190095.1190152
Exponential bounds and stopping rules for MCMC and general Markov chains Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 12
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder