Jump to content

Indexed search

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bgwhite (talk | contribs) at 02:02, 4 December 2013 (Reverted to revision 571930660 by GiantSnowman (talk): Page hijacking. (TW)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
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.

Literature

  1. ^ Ripley
  2. ^ Fishman
  • 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