Show simple item record

dc.contributor.advisorMize, Joseph H.
dc.contributor.authorMonroe, Mark Stephen
dc.date.accessioned2015-08-27T16:05:29Z
dc.date.available2015-08-27T16:05:29Z
dc.date.issued1983-12-01
dc.identifier.urihttps://hdl.handle.net/11244/16369
dc.description.abstractAs the number of uses for random numbers increases, the need for better methods of producing them increases. However, the most widely used method today was introduced over thirty years ago. These linear congruential generators are fast and compact, but the sequences they produce have been under fire for years. Attempts have been made to improve congruential sequences by shuffling them, but while this solves some of the problems, it does not solve all of the problems inherent in such a highly detenninistic method. The need was thus seen for a less detenninistic approach. The following study introduces such an approach, and compares it to accepted generators.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titleLess Deterministic Method of Random Number Generation
dc.typetext
dc.contributor.committeeMemberChandler, John P.
dc.contributor.committeeMemberKoelling, C. Patrick
osu.filenameThesis-1983-M753l.pdf
osu.accesstypeOpen Access
dc.description.departmentIndustrial Engineering and Management
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record