Results 261 to 270 of about 20,745 (303)
Some of the next articles are maybe not open access.
Computers and Biomedical Research, 1968
Abstract A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.
openaire +2 more sources
Abstract A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.
openaire +2 more sources
Random number generators for microcomputers
Computer Programs in Biomedicine, 1983The feasibility of random number generation using microcomputers is discussed and the appropriateness of alternative algorithms is evaluated on the basis of several criteria of statistical randomness. The relative deficiencies of each algorithm are cited and a modified Fibonacci generator is recommended for use in the microcomputer environment.
W, Rosenbaum, J, Syrotuik, R, Gordon
openaire +2 more sources
Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery on - ACM '59, 1959
One requirement common to all Monte Carlo computer simulations is an abundant and automatic supply of random numbers. For most purposes it generally suffices to draw this supply from the uniform distribution in the unit interval. The mathematical tricks used to convert these samplings to samplings from other distributions are well-known.
openaire +1 more source
One requirement common to all Monte Carlo computer simulations is an abundant and automatic supply of random numbers. For most purposes it generally suffices to draw this supply from the uniform distribution in the unit interval. The mathematical tricks used to convert these samplings to samplings from other distributions are well-known.
openaire +1 more source
Quantum random number generator vs. random number generator
2016 International Conference on Communications (COMM), 2016A random number generator produces a periodic sequence of numbers on a computer. The starting point can be random, but after it is chosen, everything else is deterministic. A random number generator produces a periodic sequence of numbers on a computer. The starting point can be random, but after it is chosen, everything else is deterministic.
openaire +1 more source
Pseudo Random Number Generators
2013In a first step the definition of randomness and the mathematical definition of random numbers and sequences are addressed. We move on to describe the properties of an ideal random number generator and concentrate then on pseudo random number generators which are the basic tool in the application of stochastic methods in Computational Physics ...
Benjamin A. Stickler, Ewald Schachinger
openaire +1 more source
Biometric random number generators
Computers & Security, 2004Peer ...
Janusz Szczepanski +4 more
openaire +2 more sources
Gaussian random number generators
ACM Computing Surveys, 2007Rapid generation of high quality Gaussian random numbers is a key capability for simulations across a wide range of disciplines. Advances in computing have brought the power to conduct simulations with very large numbers of random numbers and with it, the challenge of meeting increasingly stringent requirements on the quality of Gaussian random number ...
David B. Thomas +3 more
openaire +1 more source
A Natural Random Number Generator
International Statistical Review / Revue Internationale de Statistique, 1996Summary: Since the introduction of the ``middle square'' method by John von Neumann for the production of ``pseudo-random'' numbers in about 1949, hundreds of other methods have been introduced. While each may have some virtue a single uniformly superior method has not emerged.
openaire +2 more sources
On the xorshift random number generators
ACM Transactions on Modeling and Computer Simulation, 2005G. Marsaglia recently introduced a class of very fast xorshift random number generators, whose implementation uses three “xorshift” operations. They belong to a large family of generators based on linear recurrences modulo 2, which also includes shift-register generators, the Mersenne twister, and several others. In
François Panneton, Pierre L'Ecuyer
openaire +1 more source
Random Numbers Generation and Testing
200530.1 Definition of a random sequence 715 30.2 Random number generators 717 History • Properties of random number generators • Types of random number generators • Popular random number generators 30.3 Testing of random number generators 722 30.4 Testing a device 722 30.5 Statistical (empirical) tests 723 30.6 Some examples of statistical models on Σ 725
Lange, T., Lubicz, D., Weigl, A.
openaire +2 more sources