An Algorithm for Generating Random Numbers With Binomial Distribution
Dorin Bocu (2000)
The Yugoslav Journal of Operations Research
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Product replacement in the Monster.”
An Algorithm for Generating Random Numbers With Binomial Distribution
A random search algorithm for finding minimum
Ž. Mijajlović, P. Peruničić (1986)
Matematički Vesnik
Similarity:
Generating random elements in finite groups.
Dixon, John D. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
1.0957-Approximation Algorithm for Random MAX-3SAT
Wenceslas Fernandez de la Vega, Marek Karpinski (2007)
RAIRO - Operations Research
Similarity:
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
On the random character of fundamental constant expansions.
Bailey, David H., Crandall, Richard E. (2001)
Experimental Mathematics
Similarity:
On the limit behavior of a sequence of quantiles of a sample with a random number of items
D. Szynal (1973)
Applicationes Mathematicae
Similarity:
The ellipsoid method for generating normally distributed random vectors
I. Deák (1980)
Applicationes Mathematicae
Similarity:
Limit distributions of quantiles for a random sample of random length
Krystyna Kędziora (1980)
Applicationes Mathematicae
Similarity:
Random selection of mutally exclusive samples
J. B. Ukšanović (1981)
Matematički Vesnik
Similarity:
Parallel probabilistic searching and sorting algorithms
Ivan Kramosil (1990)
Kybernetika
Similarity: