Effective random seeding of random number generators |
| |
Authors: | Howard L. Kaplan |
| |
Affiliation: | 1. Addiction Research Foundation, M5S 2S1, Toronto, Ontario, Canada
|
| |
Abstract: | To obtain different sequences of values from a random number generating algorithm, we must start with different seed values or discard a variable number of initial samples. For maximum independence among sequences, differences must include the lowest order seed bits, and some generators require one to wait many samples for differences to propagate to the significant bits. While it is straightforward to generate two statistically independent sequences, it is surprisingly difficult to generate three or more such sequences. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|