Results 251 to 260 of about 115,275 (294)

Selection History Models in a Population under Ongoing Directional Selection

Jansen AC, Calus MP, Wientjes YC.
europepmc   +1 more source

Fourier Analysis of Uniform Random Number Generators [PDF]

Journal of the ACM, 1967
A method of analysis of uniform random number generators is developed, applicable to almost all practical methods of generation. The method is that of Fourier analysis of the output sequences of such generators. With this tool it is possible to understand and predict relevant statistical properties of such generators and compare and evaluate such ...
R. R. Coveyou, R. D. Macpherson
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Uniform Random Generation of Strings in a Context-Free Language

SIAM Journal on Computing, 1983
Let S be the set of all strings of length n generated by a given context-free grammar. A uniform random generator is one which produces strings from S with equal probability. In generating these strings, care must be taken in choosing the disjuncts that form the right-hand side of a grammar rule so that the produced string will have the specified ...
Timothy J. Hickey, Jacques Cohen
exaly   +2 more sources

Uniform random number generation by using sparse matrix

2012 IEEE Information Theory Workshop, 2012
We investigate the problem of (independent) uniform random number generation and secret key agreement. A generator for the (independent) uniform random numbers is constructed by using a sparse matrix and it is applied to a secret key agreement protocol with strong secrecy.
Jun Muramatsu, Shigeki Miyake
exaly   +2 more sources

Uniform Random Number Generators

Journal of the ACM, 1965
Abstract : This paper discusses the testing of methods for generating uniform numbers in a computer--the commonly used multiplicative and mixed congruential generators as well as two methods. Tests proposed here are more stringent than those usually applied, because the usual tests for randomness have passed several of the commonly used pprocedures ...
M. Donald MacLaren, George Marsaglia
openaire   +1 more source

Non-Uniform Random Variate Generation [PDF]

, 1986
. This chapter provides a survey of the main methods in non-uniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed.
Luc Devroye, Devroye, Luc
openaire   +2 more sources

Non uniform random generation of generalized Motzkin paths

Acta Informatica, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. BRLEK, PERGOLA, ELISA, O. ROQUES
openaire   +2 more sources

Uniform random number generation

Annals of Operations Research, 1994
This article provides a survey of pseudorandom number generators (i.e., deterministic recursive formulas from \(\{1, 2,\dots,m\}\) to \(\{1, 2,\dots,m\}\) for a given large prime number \(m\)) that attempt to produce a sequence (here, \(k/m\)) which approximates a sequence of truly independent random variables uniformly distributed over the interval \([
openaire   +2 more sources