Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample (Q1943114): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012669581 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1105.2266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo sampling methods using Markov chains and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Codes Over Certain Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3293678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple-Try Method and Local Optimization in Metropolis Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank

Latest revision as of 07:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample
scientific article

    Statements

    Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample (English)
    0 references
    0 references
    0 references
    15 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    Markov chain Monte Carlo
    0 references
    Metropolis-Hastings
    0 references
    information theory
    0 references
    data representation
    0 references
    algorithm
    0 references
    0 references
    0 references