Go with the winners: a general Monte Carlo strategy (Q696401): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Monte Carlo strategies in scientific computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Phase transitions of single semistiff polymer chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of incipient spanning clusters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-dimensional oriented self-avoiding walks with parallel contacts / rank | |||
Normal rank |
Latest revision as of 16:59, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Go with the winners: a general Monte Carlo strategy |
scientific article |
Statements
Go with the winners: a general Monte Carlo strategy (English)
0 references
12 September 2002
0 references
sequential Monte Carlo simulations with resampling
0 references
pruned-enriched Rosenbluth method
0 references
polymers
0 references
percolation
0 references
reaction-diffusion systems
0 references
lattice animals
0 references
sequence alignment
0 references
Markov chain
0 references
statistical physics
0 references
quantum Monte Carlo
0 references