DC Field | Value | Language |
---|---|---|
dc.contributor.author | Eleftheriou, M | ko |
dc.contributor.author | Kim, Dongsup | ko |
dc.contributor.author | Doll, JD | ko |
dc.contributor.author | Freeman, DL | ko |
dc.date.accessioned | 2013-02-28T03:47:42Z | - |
dc.date.available | 2013-02-28T03:47:42Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1997-09 | - |
dc.identifier.citation | CHEMICAL PHYSICS LETTERS, v.276, no.5-6, pp.353 - 360 | - |
dc.identifier.issn | 0009-2614 | - |
dc.identifier.uri | http://hdl.handle.net/10203/72624 | - |
dc.description.abstract | We develop a convenient, quantitative measure of the sampling efficiency of equilibrium Monte Carlo algorithms. This measure, based on information theoretic methods, is optimized by independent random sampling. We illustrate present developments with selected numerical examples. (C) 1997 Elsevier Science B.V. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | ATOMIC CLUSTERS | - |
dc.subject | PATH-INTEGRALS | - |
dc.subject | J-WALKING | - |
dc.subject | SYSTEMS | - |
dc.title | Information theory and the optimization of Monte Carlo simulations | - |
dc.type | Article | - |
dc.identifier.wosid | A1997XZ47800009 | - |
dc.identifier.scopusid | 2-s2.0-0031587257 | - |
dc.type.rims | ART | - |
dc.citation.volume | 276 | - |
dc.citation.issue | 5-6 | - |
dc.citation.beginningpage | 353 | - |
dc.citation.endingpage | 360 | - |
dc.citation.publicationname | CHEMICAL PHYSICS LETTERS | - |
dc.identifier.doi | 10.1016/S0009-2614(97)00839-7 | - |
dc.contributor.localauthor | Kim, Dongsup | - |
dc.contributor.nonIdAuthor | Eleftheriou, M | - |
dc.contributor.nonIdAuthor | Doll, JD | - |
dc.contributor.nonIdAuthor | Freeman, DL | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | ATOMIC CLUSTERS | - |
dc.subject.keywordPlus | PATH-INTEGRALS | - |
dc.subject.keywordPlus | J-WALKING | - |
dc.subject.keywordPlus | SYSTEMS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.