ラスベガス法
1. Las Vegas algorithmIn computing, a Las Vegas algorithm is a randomized algorithm that always gives correct results; that is, it always produces the correct result or it informs about the failure. In other words, a Las Vegas algorithm does not gamble with the verity of the result; it gambles only with the resources used for the computation. A simple example is randomized quicksort, where the pivot is chosen randomly, but the result is always sorted.
Read “Las Vegas algorithm” on English Wikipedia
Read “ラスベガス法” on Japanese Wikipedia
Read “Las Vegas algorithm” on DBpedia
Read “Las Vegas algorithm” on English Wikipedia
Read “ラスベガス法” on Japanese Wikipedia
Read “Las Vegas algorithm” on DBpedia
Discussions
Log in to talk about this word.