메뉴 건너뛰기




Volumn 72, Issue 3, 2001, Pages 303-314

New insights into the assessment of k-out-of-n and related systems

Author keywords

Binary decision diagrams; k out of n and related systems

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DECISION THEORY;

EID: 0035369747     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0951-8320(01)00024-2     Document Type: Article
Times cited : (26)

References (15)
  • 12
    • 0022865215 scopus 로고
    • Utillization of symmetric switching functions in the computations of k-out-of-n systems reliability
    • (1986) Microelectron Reliab , vol.26 , Issue.5 , pp. 973-987
    • Rushdi, A.M.1
  • 13
    • 0026140443 scopus 로고
    • Comment on: An efficient non-recursive algorithm for computing the reliability of k-out-of-n systems
    • (1991) IEEE Trans Reliab , vol.40 , Issue.1 , pp. 60-61
    • Rushdi, A.M.1
  • 15
    • 0022080297 scopus 로고
    • Rearrangement inequality for the longuest run, with application to network reliability
    • (1985) J Appl Prob , vol.22 , pp. 286-393
    • Tong, Y.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.