SOME GOOD MULTIPLIERS FOR RANDOM NUMBER GENERATOR FOR 16-BIT MICROCOMPUTERS

dc.citation.epage	204	en_US
dc.citation.issue	2	en_US
dc.citation.spage	199	en_US
dc.citation.volume	21	en_US
dc.citation.woscount	1
dc.contributor.author	CHANG, PL	en_US
dc.contributor.author	HWANG, SN	en_US
dc.contributor.author	KAO, C	en_US
dc.contributor.department	管理科學系	zh_TW
dc.contributor.department	Department of Management Science	en_US
dc.date.accessioned	2014-12-08T15:04:08Z
dc.date.available	2014-12-08T15:04:08Z
dc.date.issued	1994-02-01	en_US
dc.description.abstract	In searching for statistically sound multipliers for the prime modulus multiplicative congruential random number generator for 16-bit microcomputers, an exhaustive analysis is conducted over the 10,912 primitive roots of the modulus 2(15)-19=32,749. The result shows that there are only 227 good multipliers among the 10,912 candidate multipliers. Here a multiplier is said to be good if its corresponding generator has good statistical properties and computational efficiency.	en_US
dc.identifier.issn	0305-0548	en_US
dc.identifier.journal	COMPUTERS & OPERATIONS RESEARCH	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/2632
dc.identifier.wosnumber	WOS:A1994MK14900008
dc.language.iso	en_US	en_US
dc.title	SOME GOOD MULTIPLIERS FOR RANDOM NUMBER GENERATOR FOR 16-BIT MICROCOMPUTERS	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1