P. L'Ecuyer, Uniform random number generation, Ann. Oper. Res., 53:77--120 (1994). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Shortcomings of the ns-2 Random Number Generator - Hechenleitner, Entacher (2002) (Correct)
....generator, which was originally suggested for the IBM System 360 by Lewis, Goodman and Miller in 1969 [13] It was examined in more detail in Park and Miller [20] and further on in several other studies on random number generation. This generator is a multiplicative linear congruential type [7, 11, 19] which produces pseudorandom integers via the re This work is partly funded by the EU IST project AQUILA. cursion (1) with multiplier a 16807, modulus m 2 2147483647, and seed 1 m. The period length of this recursion equals p m 1. Uniform pseudorandom numbers 1 are ....
....length of this recursion equals p m 1. Uniform pseudorandom numbers 1 are derived by the transformation u n m, nonuniform distributions by different transformation methods [4] Generators of this type have widely been used and actual implementations are available from the Internet. See [1, 7, 10, 11, 14, 20, 21] and the Internet for references, empirical tests and implementations in free and commercial software, as for example Resampling Stats (www.resample.com) Numerical Recipes (www.nr.com) the mathematical software MATLAB (www.mathworks.com) the IMSL Libraries, or the simulation software ACSL ....
[Article contains additional citation context not shown here]
P. L'Ecuyer. Uniform random number generation. Ann. Oper. Res., 53:77--120, 1994.
A simple OMNeT++ queuing experiment using different.. - Hechenleitner, Entacher (2002) (Correct)
....suggested for the IBM System 360 by Lewis, Goodman and Miller in 1969 [15] It was examined in more detail in Park and Miller [19] and further on in several other studies on random number generation. We will denote this RNG as ran0 . This generator is a multiplicative linear congruential type [6, 8, 10, 11, 18] which produces pseudorandom integers via the recursion x n a x n 1 mod m n 1 (1) with multiplier a 7 16807, modulus m 2 1 2147483647, and seed 1 x 0 m. The period length of this recursion equals p m 1. Uniform pseudorandom numbers in 0 1 are derived by ....
....recursion equals p m 1. Uniform pseudorandom numbers in 0 1 are derived by transformation u n x n m, non uniform distributions by different transformation methods [3] This particular generator has widely been used and actual implementations are available from the Internet. See [1, 6, 8, 10, 11, 12, 13, 14, 19] for references, empirical tests and implementations in free and commercial software. The following online resources contain related material: Resampling Stats (www.resample.com) Numerical Recipes (www.nr.com) the mathematical software MATLAB (www. mathworks.com) the IMSL Libraries, or the ....
[Article contains additional citation context not shown here]
P. L'Ecuyer. Uniform random number generation. Ann. Oper. Res., 53:77-- 120, 1994.
On Shortcomings of the ns-2 Random Number Generator - Entacher, Hechenleitner (2001) (Correct)
....generator, which was originally suggested for the IBM System 360 by Lewis, Goodman and Miller in 1969 [11] It was examined in more detail in Park and Miller [17] and further on in several other studies on random number generation. This generator is a multiplicative linear congruential type [7, 10, 16] which produces pseudorandom integers via the recursion 1 mod m n 1 (1) with multiplier 16807, modulus 2147483647, and seed m. The period length of this recursion equals 1. Uniform pseudorandom numbers in are derived by the transformation u m, nonuniform ....
....length of this recursion equals 1. Uniform pseudorandom numbers in are derived by the transformation u m, nonuniform distributions by different transformation methods [5] Generators of this type have widely been used and actual implementations are available from the Internet. See [1, 2, 7, 9, 10, 12, 17, 18] and the Internet for references, empirical tests and implementations in free and commercial software, as for example Resampling Stats (www.resample.com) Numerical Recipes (www.nr.com) the mathematical software MATLAB (www.mathworks.com) the IMSL Libraries, or the simulation software ACSL ....
P. L'Ecuyer. Uniform random number generation. Ann. Oper. Res., 53:77-- 120, 1994.
Construction of Equidistributed Generators - Based On Linear Self-citation (L'ecuyer) (Correct)
No context found.
P. L'Ecuyer. Uniform random number generation. Annals of Operations Research, 53:77-120, 1994.
On the Performance of Birthday Spacings - Tests With Certain Self-citation (L'ecuyer) (Correct)
No context found.
P. L'Ecuyer. Uniform random number generation. Annals of Operations Research, 53:77--120, 1994.
Random Number Generation - L'Ecuyer Self-citation (L'ecuyer) (Correct)
No context found.
L'Ecuyer, P. (1994). Uniform random number generation. Annals of Operations Research, Vol. 53, pp. 77--120.
Design Flaws in the Implementation of the Ziggurat and Monty .. - Randn Boaz Nadler (Correct)
No context found.
P. L'Ecuyer, Uniform random number generation, Ann. Oper. Res., 53:77--120 (1994).
Pitfalls when using parallel streams in OMNeT++ simulations - Bernhard Hechenleitner And (2003) (Correct)
No context found.
P. L'Ecuyer. Uniform random number generation. Ann. Oper. Res., 53:77--120, 1994.
Analysis of the Multiple Excess-S Modulo K (MSK) Coding Scheme - Fea (2003) (Correct)
No context found.
P. L. L'Ecuyer. Uniform random number generation. Annals of Operations Research, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC