Alastair J. Walker
- 1 MARSAGLIA, G. Generating discrete random variables in a computer. Comm. ACM 6, 1 (1963), 37-38. Google Scholar
- 2 I~AMBERG, J.S., AND SCHMEISER, B.W An approximate method for generating symmetric random variables Comm. ACM 15, 11 (Nov. 1972), 987-990. Google Scholar
- 3 SOBOLEWSKI, J.S , AND PAYNE, W.H. Pseudo-noise with arbitrary amplitude distribution. 1EEE Trans. Computers C-21 (1972), 337-345.Google Scholar
- 4 WALKER, A.J Fast generation of uniformly distrlbuted pseudorandom numbers with floating point representation. Electron. Lett. 10, 25/26 (1974), 553-554.Google Scholar
- 5 WALKER, A J. New fast method for generating discrete random numbers with arbitrary frequency distributions. Electron. Lett 10, 8 (1974), 127-128.Google Scholar
Index Terms
- An Efficient Method for Generating Discrete Random Variables with General Distributions
Recommendations
Intelligent Random Sequence Generating
ICNC '09: Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 04Cryptographic systems need strings of randomly chosen bits in order to function correctly. The most obvious need is with key generation.A secret key must be un-guessable for it to be secure.If a Random Number Generator (RNG) meets this fundamental ...
A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
We consider a discrete-time Geo/G/1 retrial queue in which the retrial time has a general distribution and the server, after each service completion, begins a process of search in order to find the following customer to be served. We study the Markov ...
Discrete-time queue with batch renewal input and random serving capacity rule: $$GI^X/ Geo^Y/1$$GIX/GeoY/1
In this paper, we provide a complete analysis of a discrete-time infinite buffer queue in which customers arrive in batches of random size such that the inter-arrival times are arbitrarily distributed. The customers are served in batches by a single ...
Comments