Search results for "module:Math::Random::MT"
Math::Random::MT - The Mersenne Twister PRNG
The Mersenne Twister is a pseudorandom number generator developed by Makoto Matsumoto and Takuji Nishimura. It is described in their paper at <URL:http://www.math.keio.ac.jp/~nisimura/random/doc/mt.ps>. This algorithm has a very uniform distribution ...
FANGLY/Math-Random-MT-1.17 - 27 Nov 2015 19:22:08 UTC
Math::Random::MT::Auto - Auto-seeded Mersenne Twister PRNGs
The Mersenne Twister is a fast pseudorandom number generator (PRNG) that is capable of providing large volumes (> 10^6004) of "high quality" pseudorandom data to applications that may exhaust available "truly" random data sources or system-provided P...
JDHEDDEN/Math-Random-MT-Auto-6.23 - 27 Nov 2018 03:25:49 UTC
Math::Random::MT::Perl - Pure Perl Mersenne Twister Random Number Generator
Pure Perl implementation of the Mersenne Twister algorithm. Mersenne Twister is a 32 bit pseudorandom number generator developed by Makoto Matsumoto and Takuji Nishimura. The algorithm is characterised by a very uniform distribution but is not crypto...
FANGLY/Math-Random-MT-Perl-1.15 - 27 Nov 2015 19:31:13 UTC
Math::Random::MT::Auto::Range - Range-valued PRNGs
This module creates range-valued pseudorandom number generators (PRNGs) that return random values between two specified limits. While useful in itself, the primary purpose of this module is to provide an example of how to create subclasses of Math::R...
JDHEDDEN/Math-Random-MT-Auto-6.23 - 27 Nov 2018 03:25:49 UTC
Graphics::VTK::Common - A Perl interface to VTKCommon library
Graphics::VTK::Common is an interface to the Common libaray of the C++ visualization toolkit VTK.....
CERNEY/Graphics-VTK-4.0.001 - 01 Feb 2003 15:47:39 UTC
Math::Random::OO - Consistent object-oriented interface for generating random numbers
CPAN contains many modules for generating random numbers in various ways and from various probability distributions using pseudo-random number generation algorithms or other entropy sources. (The "SEE ALSO" section has some examples.) Unfortunately, ...
DAGOLDEN/Math-Random-OO-0.22 - 09 Jun 2013 19:08:46 UTC
Math::Random::Cauchy - Random numbers following a Cauchy PDF
This module transforms uniformly spaced random numbers into random numbers that follow the Cauchy Probability Density Function (*PDF*). A more general transformation method is implemented in Math::Random::AcceptReject. The algorithm is from Blobel et...
SMUELLER/Math-Random-Cauchy-0.02 - 06 Jan 2007 18:33:59 UTC
Bundle::Math::Random - Bundle of modules related to random numbers
This is a bundle of modules related to random numbers. Please have a look at Bundle::Math. If you would like to see a specific module included in a future version of this bundle, please send me an email or use rt.cpan.org....
SMUELLER/Bundle-Math-Random-1.02 - 11 Jul 2005 21:45:32 UTC
Math::Random::ISAAC - Perl interface to the ISAAC PRNG algorithm
As with other Pseudo-Random Number Generator (PRNG) algorithms like the Mersenne Twister (see Math::Random::MT), this algorithm is designed to take some seed information and produce seemingly random results as output. However, ISAAC (Indirection, Shi...
JAWNSY/Math-Random-ISAAC-1.004 - 18 Feb 2011 02:34:58 UTC
Math::SimpleHisto::XS - Simple histogramming, but kinda fast
This module implements simple 1D histograms with fixed or variable bin size. The implementation is mostly in C with a thin Perl layer on top. If this module isn't powerful enough for your histogramming needs, have a look at the powerful-but-experimen...
SMUELLER/Math-SimpleHisto-XS-1.30 - 23 May 2014 05:54:21 UTC
Math::Prime::Util::GMP - Utilities related to prime numbers and factoring, using GMP
A module for number theory in Perl using GMP. This includes primality tests, getting primes in a range, factoring, and more. While it certainly can be used directly, the main purpose of this module is for Math::Prime::Util. That module will automatic...
DANAJ/Math-Prime-Util-GMP-0.52 - 22 Jun 2020 09:19:08 UTC
Math::Random::Xorshift - a fast PRNG
This module is a straight forward implementation of Xorshift PRNG proposed by G. Marsaglia in 2003. Note that the algorithm is extremely fast and passes the Diehard test <http://www.stat.fsu.edu/pub/diehard/> though, is not reliable enough statistica...
SEKIA/Math-Random-Xorshift-0.05 - 22 Dec 2010 06:44:26 UTC
Math::Random::AcceptReject - Acceptance-Rejection PDF transformations
This module implements acceptance-rejection transformations of uniformly distributed random numbers to mostly arbitrary probability density functions (*PDF*s). Note that whereas J. von Neumann's algorithm can transform from arbitrary source PDFs to a...
SMUELLER/Math-Random-AcceptReject-0.02 - 05 Jan 2007 15:22:25 UTC