Thumbnail
Access Restriction
Subscribed

Author Kachitvichyanukul, Voratas ♦ Schmeiser, Bruce W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Existing binomial random-variate generators are surveyed, and a new generator designed for moderate and large means is developed. The new algorithm, BTPE, has fixed memory requirements and is faster than other such algorithms, both when single, or when many variates are needed.
Description Affiliation: Purdue Univ., West Lafayette, IN (Schmeiser, Bruce W.) || Univ. of Iowa, Iowa City (Kachitvichyanukul, Voratas)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 31
Issue Number 2
Page Count 7
Starting Page 216
Ending Page 222


Open content in new tab

   Open content in new tab
Source: ACM Digital Library