Interval algorithm for random number generation

The problem of generating a random number with an arbitrary probability distribution by using a general biased M-coin is studied. An efficient and very simple algorithm based on the successive refinement of partitions of the unit interval (0, 1), which we call the interval algorithm, is proposed. A...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on information theory Ročník 43; číslo 2; s. 599 - 611
Hlavní autori:	Te Sun Han, Hoshi, M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.1997 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Arithmetic Entropy Information processing Markov processes Numbers Partitioning algorithms Probability distribution Random number generation Stochastic processes Sun Tellurium Upper bound
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!