Jump to content

Indexed search

Add links
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by BD2412 (talk | contribs) at 00:12, 16 January 2024 (→Sources: clean up spacing around commas and other punctuation fixes, replaced: ,G → , G). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
For the use of indices in search engines, see Search engine indexing.

Indexed search,[1] also called the cutpoint method,[2] is an algorithm for discrete-distribution pseudo-random number sampling, invented by Chen and Asau in 1974.

References

[edit]
  1. ^ Ripley
  2. ^ Fishman

Sources

[edit]
  • Chen, H. C.; Asau, Y. (1974). "On Generating Random Variates from an Empirical Distribution". AIIE Transactions. 6 (2): 163–166. doi:10.1080/05695557408974949.
  • Fishman, G.S. (1996) Monte Carlo. Concepts, Algorithms, and Applications. New York: Springer.
  • Ripley, B. D. (1987) Stochastic Simulation. Wiley. ISBN 0-471-81884-4
Retrieved from "https://en.wikipedia.org/w/index.php?title=Indexed_search&oldid=1195982480"