Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work (Q2270192): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:06, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work |
scientific article |
Statements
Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work (English)
0 references
15 March 2010
0 references
combinatorial optimization
0 references
Gibbs sampler
0 references
importance sampling
0 references
rare events
0 references
numerical examples
0 references
randomized algorithms
0 references
approximate counting
0 references
Markov chains
0 references
algorithms
0 references
cloning algorithm
0 references
Markov chain Monte Carlo method
0 references
