Results 261 to 270 of about 115,275 (294)
Some of the next articles are maybe not open access.
Generating Uniform Random Vectors
Journal of Theoretical Probability, 2001The author investigates the properties of the Markov chain \(X_{n+1} = AX_n+b_n \mod p\), where \(b_i\) are identically distributed independent random integer vectors of dimension \(m\), \(A\) is an \(m\)-dimensional integer matrix and \(p\) a prime number. The paper deals mainly with the case when \(A\) is regular.
openaire +3 more sources
Uniform Random Generation of Huge Metamodel Instances
2009The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalability, some approaches claim to provide mechanisms that are adapted to numerous and huge models.
Mougenot, Alix +3 more
openaire +1 more source
The Subgroup Algorithm for Generating Uniform Random Variables
Probability in the Engineering and Informational Sciences, 1987We suggest a simple algorithm for Monte Carlo generation of uniformly distributed variables on a compact group. Example include random permutations, Rubik's cube positions, orthogonal, unitary, and symplectic matrices, and elements ofGLnover a finite field.
Diaconis, Persi, Shahshahani, Mehrdad
openaire +2 more sources
Uniform Random Generation of Balanced Parenthesis Strings
ACM Transactions on Programming Languages and Systems, 1980The empirical testing of error repair schemes for skeletons of source programs in a block-structured language leads to the problem of generating balanced parenthesis strings in a uniform random manner. An efficient generator which works from left to right must compute the correct probability for the next symbol at each stage of the ...
D. B. Arnold, M. Ronan Sleep
openaire +1 more source
Uniform random number generator
ACM SIGSIM Simulation Digest, 1976The recent flurry of random number routines and your continued plea for material had led me to dust off my favorite trick uniform random number generator. It requires no seed, produces numbers uniformly distributed between 0 and 1, is acyclic and for all practical purposes, is completely unpredictable and irreproducible.
openaire +1 more source
Uniform Random Rational Number Generation
2007Classical floating point random numbers fail simple tests when considered as rational numbers.
openaire +1 more source
Uniform random number generators for parallel computers
Parallel Computing, 1990Abstract Almost all simulational computations require uniformly distributed random numbers. Generators of uniform random numbers are considered and assessed with respect to their possible use on parallel computers. Two recent, commercially available computers are given special attention: the Connection Machine and the T Series.
openaire +1 more source
Generating uniform random points inside a cone
Monte Carlo Methods and Applications, 2000Summary: An algorithm for generating random points uniformly distributed in an arbitrary cone from \(\mathbb{R}^n\) is suggested. As a particular case, a recurrent algorithm to generate uniform random points inside a general \(n\)-simplex is proposed. The quality of the resulted random points is tested.
openaire +1 more source
Generating Uniform Random Numbers
2018Integers uniformly distributed over some interval are at the heart of pseudorandom number generators. This chapter examines techniques for generating pseudorandom integers: some historical, some useful for noncritical tasks such as games, and others which are workhorses and should be thought of as go-to methods.
openaire +1 more source
Non-uniform random number generation
ACM SIGSIM Simulation Digest, 1972A frequently used technique for generating non-uniform random numbers is to combine uniform random numbers. For example, the sum of two uniform random numbers yields a triangular distribution. The difference yields another which will be statistically independent.
openaire +1 more source