메뉴 건너뛰기




Volumn R-31, Issue 1, 1982, Pages 57-63

On the Consecutive-k-of-n:F System

Author keywords

Consecutive k out of n; F system

Indexed keywords

RELIABILITY THEORY;

EID: 0020116017     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1982.5221229     Document Type: Article
Times cited : (206)

References (5)
  • 2
    • 0019556404 scopus 로고    scopus 로고
    • Reliability of consecutive k-out-of-n
    • 81 Apr
    • D. Chaing, S.C. Niu, “Reliability of consecutive k-out-of-n,” IEEE Trans. Reliability, vol R-30, 81 Apr, pp 87–89.
    • IEEE Trans. Reliability , vol.R-30 , pp. 87-89
    • Chaing, D.1    Niu, S.C.2
  • 3
    • 0019241839 scopus 로고    scopus 로고
    • Reliability determination of a r-successive-out-of-n system
    • 80 Dec
    • J.M. Kontoleon, “Reliability determination of a r-successive-out-of-n system,” IEEE Trans. Reliablity, vol R-29, 80 Dec, p 437.
    • IEEE Trans. Reliablity , vol.R-29 , pp. 437
    • Kontoleon, J.M.1
  • 4
    • 0039014242 scopus 로고    scopus 로고
    • The largest clique size in a random graph
    • SMU Technical Report CS 7608, 76 April. Available from Southern Methodist University
    • D. Matula, “The largest clique size in a random graph,” SMU Technical Report CS 7608, 76 April. Available from Southern Methodist University.
    • Matula, D.1
  • 5
    • 84939735229 scopus 로고    scopus 로고
    • Conditionally increasing processes
    • University of California - Berkeley, Operations Research Center Technical Report, to appear. Available from University of California, Berkeley; Operations Research Center
    • Z. Schechner, “Conditionally increasing processes,” University of California - Berkeley, Operations Research Center Technical Report, to appear. Available from University of California, Berkeley; Operations Research Center.
    • Schechner, Z.1


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