Results 221 to 230 of about 439,273 (266)
Some of the next articles are maybe not open access.
2021
To perform a Monte Carlo approximation, we have to generate random variables (rv.) on a computer according to a given df. F. In this chapter, we will discuss some commonly used procedures and their application under R. Since most of the widely used distributions are implemented in R, random variables according to these distributions can easily be ...
Gerhard Dikta, Marsel Scheer
openaire +1 more source
To perform a Monte Carlo approximation, we have to generate random variables (rv.) on a computer according to a given df. F. In this chapter, we will discuss some commonly used procedures and their application under R. Since most of the widely used distributions are implemented in R, random variables according to these distributions can easily be ...
Gerhard Dikta, Marsel Scheer
openaire +1 more source
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
2023
The purpose of the chapter is to introduce basic concepts of random sequence generation that can be used in the simulation modeling of random flows. In the first part, features of random number generators (RNGs) are presented, distinguishing the two directions of realization – true RNGs and pseudo-RNGs.
openaire +1 more source
The purpose of the chapter is to introduce basic concepts of random sequence generation that can be used in the simulation modeling of random flows. In the first part, features of random number generators (RNGs) are presented, distinguishing the two directions of realization – true RNGs and pseudo-RNGs.
openaire +1 more source
International Journal of Modern Physics C, 1991
In large-scale Monte Carlo simulations, reliable random numbers will soon be needed at bit rates of 1 GHz or more. Therefore, existing recipes for the generation of random numbers have to be improved. This is not easy, due to the many unrelated and laborious statistical tests needed to compensate for the lack of an accepted and operational definition ...
openaire +1 more source
In large-scale Monte Carlo simulations, reliable random numbers will soon be needed at bit rates of 1 GHz or more. Therefore, existing recipes for the generation of random numbers have to be improved. This is not easy, due to the many unrelated and laborious statistical tests needed to compensate for the lack of an accepted and operational definition ...
openaire +1 more source
2015
The need to generate random numbers arises very often. Most games programs, programs that simulate the real world, almost always need the ability to generate random numbers. Testing a complex program usually needs random input at some point to validate that the program works under diverse conditions, and it’s often convenient to generate such input ...
openaire +1 more source
The need to generate random numbers arises very often. Most games programs, programs that simulate the real world, almost always need the ability to generate random numbers. Testing a complex program usually needs random input at some point to validate that the program works under diverse conditions, and it’s often convenient to generate such input ...
openaire +1 more source
2010
Much of this book deals with simulation methods for probability models, also called Monte Carlo methods. We have seen a few introductory examples in Chapter 1. Even for some models that are easy to specify in a theoretical form, it may be difficult or impossible to “do the math” necessary to obtain the numerical results required in practice. Because of
P.J. Pashley, A. Amodeo
+4 more sources
Much of this book deals with simulation methods for probability models, also called Monte Carlo methods. We have seen a few introductory examples in Chapter 1. Even for some models that are easy to specify in a theoretical form, it may be difficult or impossible to “do the math” necessary to obtain the numerical results required in practice. Because of
P.J. Pashley, A. Amodeo
+4 more sources
Journal of the Royal Statistical Society. Series A (General), 1967
John M. Chambers, Birger Jansson
+5 more sources
John M. Chambers, Birger Jansson
+5 more sources
2016
One of the possible applications of chaotic oscillators is generating sequences of pseudorandom binary numbers. This chapter describes a methodology for generating such pseudorandom binary numbers from the logistic map, Lorenz and Rossler chaotic systems, Chua and chaotic oscillator based on saturated function series. A form to measure if a sequence of
Esteban Tlelo-Cuautle +2 more
openaire +1 more source
One of the possible applications of chaotic oscillators is generating sequences of pseudorandom binary numbers. This chapter describes a methodology for generating such pseudorandom binary numbers from the logistic map, Lorenz and Rossler chaotic systems, Chua and chaotic oscillator based on saturated function series. A form to measure if a sequence of
Esteban Tlelo-Cuautle +2 more
openaire +1 more source