Thumbnail
Access Restriction
Subscribed

Author Miller, G. D.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Optimum ♦ Probability ♦ Set union ♦ Mutually exclusive events ♦ Algorithm ♦ Storage vs. time compromise
Abstract An algorithm is presented which efficiently evaluates the probability for the union of n independent and not mutually exclusive events. The problem is that of evaluating the sums of the products of all possible combinations of n variables in minimum time and storage space.
Description Affiliation: Univ. of Canterbury, Christchurch, New Zealand (Miller, G. D.)
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 11
Issue Number 9
Page Count 2
Starting Page 630
Ending Page 631


Open content in new tab

   Open content in new tab
Source: ACM Digital Library