Monte Carlo algorithm
Randomized algorithm with some probability of producing the wrong result
In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability. Two examples of such algorithms are the Karger–Stein algorithm and the Monte Carlo algorithm for minimum feedback arc set.
Nº Q15238499 ★★
Uncommon · History
Monte Carlo algorithm
Randomized algorithm with some probability of producing the wrong result
In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability. Two examples of such algorithms are the Karger–Stein algorithm and the Monte Carlo algorithm for minimum feedback arc set.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability. Two examples of such algorithms are the Karger–Stein algorithm and the Monte Carlo algorithm for minimum feedback arc set. The name refers to the Monte Carlo casino in the Principality of Monaco, which is well-known around the world as an icon of gambling. The term "Monte Carlo" was first introduced in 1947 by Nicholas Metropolis. Las Vegas algorithms are a dual of Monte Carlo algorithms and never return an incorrect answer. However, they may make random choices as part of their work. As a result, the time taken might vary between runs, even with the same input. If there is a procedure for verifying whether the answer given by a Monte Carlo algorithm is correct, and the probability of a correct answer is bounded above zero, then with probability one, running the algorithm repeatedly while testing the answers will eventually give a correct answer. Whether this process is a Las Vegas algorithm depends on whether halting with probability one is considered to satisfy the definition.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Monte Carlo method
Broad class of computational algorithms using random sampling to obtain numerical results
Nº Q232207 ★★★★
Metropolis–Hastings algorithm
Algorithm
Nº Q910810 ★★
Computational complexity
Measure of the amount of resources needed to run an algorithm or solve a computational problem
Nº Q5157286 ★★★
Gradient descent
Optimization algorithm
Nº Q1199743 ★★★
Minimax
Decision rule used for minimizing the possible loss for a worst case scenario
Nº Q751319 ★★★
Algorithmics
Study of algorithms and data structures
Nº Q13636890 ★★★