Random Selection from a Stream of Events.

The article discusses a method for randomly selecting one event from a stream of events, under specified conditions. These conditions include ensuring that each event has an equal probability of being chosen, and choosing one before it is known whether all the events have transpired or not. The usef...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 53; no. 1; pp. 158 - 160
Autor principal: DREZNER, ZVI
Formato: Artículo
Publicado: Association for Computing Machinery Jan2010
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=47220629&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 47220629
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Jan2010
      vid: 53
      iid: 1
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        47220629
        10.1145/1629175.1646395
      ppf: 158
      ppct: 2
      formats:
      tig:
        atl: Random Selection from a Stream of Events.
      aug:
        au: DREZNER, ZVI
        affil: Professor of Information Systems and Decision Sciences, Steven G. Mihaylo College of Business and Economics, California State University-Fullerton, Fullerton, CA.
      su:
        Mathematical optimization
        Probability theory
        Mathematical proofs
        Heuristic
        Algorithms
        Mathematical analysis
      sug:
        subj:
          Mathematical optimization
          Probability theory
          Mathematical proofs
          Heuristic
          Algorithms
          Mathematical analysis
      ab: The article discusses a method for randomly selecting one event from a stream of events, under specified conditions. These conditions include ensuring that each event has an equal probability of being chosen, and choosing one before it is known whether all the events have transpired or not. The usefulness of such a method for heuristic optimization computer algorithms is noted. A theorem and proof are offered which demonstrate that an inverse relationship between the event's sequential number and its probability of being chosen can effectively satisfy the necessary conditions.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2010
    holdings:
      @attributes:
        islocal: N