Skip to content
VuFind
Advanced
  • An O(n) algorithm to compute t...
  • Cite this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
An O(n) algorithm to compute the reliability of consecutive k-out-of-r-from-n :F system under the condition of r < 2k
QR Code

An O(n) algorithm to compute the reliability of consecutive k-out-of-r-from-n :F system under the condition of r < 2k

Bibliographic Details
Main Authors: Higashiyama, Y., Cai, X., Rumchev, Ventsi
Other Authors: Nagib Callaos
Format: Conference Paper
Published: International Institure of Informatics and Cybernetics 2010
Online Access:http://hdl.handle.net/20.500.11937/23127
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/20.500.11937/23127

Similar Items

  • New method for the failure probability of strict circular consecutive-k-out-of-n:F system
    by: Higashiyama, Y., et al.
    Published: (2010)
  • A method for exact reliability of consecutive 2-out-of-(r,r)-from-(n,n): F system
    by: Higashiyama, Yoichi, et al.
    Published: (2007)
  • Reliability evaluation of consecutive 2-out-of-(r,r)-from--(n,n):F system with unequal component probabilities
    by: Higashiyama, Yoichi, et al.
    Published: (2007)
  • New algorithm for computing exact reliability formula of weighted-k-out-of-n system using SDP method
    by: Higashiyama, Yoichi, et al.
    Published: (2009)
  • New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system
    by: Higashiyama, Yoichi, et al.
    Published: (2007)

Search Options

  • Advanced Search

Find More

  • Browse the Catalog

Need Help?

  • Search Tips