๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A recursive algorithm for a summed multinomial density function

โœ Scribed by Raymond K. Fink; Herbert Moskowitz

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
446 KB
Volume
25
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

An algorithm for calculating the probabilities of a summed multinomial density function which is recursive with n (the number of trials) is presented. Having application in inspector error models for auditing and quality control problems with Cartesian product structures, the algorithm is discussed in the context of computing optimal economic sampling plans. Computational experience with the algorithm is presented.

๐Ÿ“œ SIMILAR VOLUMES

A recursive decomposition algorithm for
A recursive decomposition algorithm for network seismic reliability evaluation
โœ Jie Li; Jun He ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 181 KB

## Abstract A new probabilistic analytical approach to evaluate seismic system reliability of large lifeline systems is presented in this paper. The algorithm takes the shortest path from the source to the terminal of a node weight or edge weight network as decomposition policy, using the Boolean l

A technique for overlapping computation
A technique for overlapping computation and communication for block recursive algorithms
โœ GUPTA, S. K. S.; HUANG, C.-H.; SADAYAPPAN, P.; JOHNSON, R. W. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 175 KB

This paper presents a design methodology for developing efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed-memory a