Title :
The efficiency of computing the reliability of k-out-of n systems
Author :
Pham, Hoang ; Upadhyaya, Shambhu J.
Author_Institution :
State Univ. of New York, Buffalo, NY, USA
fDate :
12/1/1988 12:00:00 AM
Abstract :
It is shown that the algorithm of R.S. Barlow and K.D. Heidtmann (ibid., vol.R-33, p.322-3, Oct. 1984) is more computationally efficient than those reported by S.P. Jain and K. Gopal (ibid., vol.R-34, p.144-6, June 1985) and S. Rai et al. (ibid., vol.R-36, p.261-5, June 1987). Efficiency is measured here by the number of multiplications
Keywords :
reliability theory; computational efficiency; k-out-of-n systems; reliability; Algorithm design and analysis; Combinatorial mathematics; Computational complexity; Probability;
Journal_Title :
Reliability, IEEE Transactions on
