This monograph proves that any finite random number sequence is represented by the multiplicative congruential (MC) way. It also shows that an MC random number generator (d, z) formed by the modulus d and the multiplier z should be selected by new regular
NAKAZAWA, NAOYA,NAKAZAWA, HIROSHI
Random Number Generators on Computers
This monograph proves that any finite random number sequence is represented by the multiplicative congruential (MC) way. It also shows that an MC random number generator (d, z) formed by the modulus d and the multiplier z should be selected by new regular
Zaloga po trgovinah
Rezultati:
Podrobnosti o izdelku
Poglej vseISBN
9789814968492Mladinska knjiga ID
9789814968492Leto izida
2024Datum izida
28.11.2024Število strani
110Status dobavljivosti
7-10 delovnih dniZaložnik
Jenny Stanford PublishingAvtor
Nakazawa, Naoya,Nakazawa, HiroshiDimenzije
234 x 159 x 14BIC
PBW,PHU,THR,TJF,UFM,UYOpis
This monograph proves that any finite random number sequence is represented by the multiplicative congruential (MC) way. It also shows that an MC random number generator (d, z) formed by the modulus d and the multiplier z should be selected by new regular simplex criteria to give random numbers an excellent disguise of independence.Pogosto kupljeno skupaj
Trda vezava
Ostali so si ogledali tudi ...
