A revised forward and backward heuristic for two-term multiple recursive random number generators
From MaRDI portal
Publication:870156
DOI10.1016/J.AMC.2006.06.093zbMATH Open1110.65007OpenAlexW2085464741MaRDI QIDQ870156FDOQ870156
Authors: Ching-Jing Kung, Hui-Chin Tang 
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.093
Recommendations
- A backward heuristic algorithm for two-term multiple recursive random number generators
- Theoretical analyses of forward and backward heuristics of multiple recursive random number generators
- A new heuristic for second-order multiple recursive random number generator
- An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
- A partial exhaustive search for good two-term third-order multiple recursive random number generators
- Searching for good two-term multiple recursive random number generators using a backpropagation algorithm
- An exhaustive analysis of two-term multiple recursive random number generators with double precision floating point restricted multipliers
- The revised recursive reduction for efficiently generating random numbers
- A search for good multiple recursive random number generators
- Searching for good two-term fifth-order multiple recursive random number generators
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Systematic searches for good multiple recursive random number generators
- Searching for good multiple recursive random number generators via a genetic algorithm
- A search for good multiple recursive random number generators
- Upper bounds in spectral test for multiple recursive random number generators with missing terms
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
- Fourier Analysis of Uniform Random Number Generators
- Symmetry properties of multiple recursive random number generators in full period and spectral test
- Reverse multiple recursive random number generators
Cited In (11)
- Searching for good two-term fifth-order multiple recursive random number generators
- A new approach to analyze the independence of statistical tests of randomness
- Searching for good two-term multiple recursive random number generators using a backpropagation algorithm
- A new heuristic for second-order multiple recursive random number generator
- Using an adaptive genetic algorithm with reversals to find good second-order multiple recursive random number generators
- Theoretical analyses of forward and backward heuristics of multiple recursive random number generators
- An exhaustive analysis of two-term multiple recursive random number generators with double precision floating point restricted multipliers
- A backward heuristic algorithm for two-term multiple recursive random number generators
- An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
- A partial exhaustive search for good two-term third-order multiple recursive random number generators
- Searching for good multiple recursive random number generators via a genetic algorithm
This page was built for publication: A revised forward and backward heuristic for two-term multiple recursive random number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870156)
