File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient enumeration of most probable states for systems with dependent failures and multimode components

TitleEfficient enumeration of most probable states for systems with dependent failures and multimode components
Authors
Le, Khiem VLi, Victor OK
Issue Date1990
Citation
Ieee Global Telecommunications Conference And Exhibition, 1990, v. 2, p. 693-697 How to Cite?
AbstractORDER-c, an algorithm for enumerating, in order of nonincreasing probability, the states of systems with dependent failures and multimode components is presented. The dependencies and degradations are modeled by the cause-based multimode model, which is reviewed. The ORDER-b algorithm is also reviewed, and the ORDER-b and ORDER-c algorithms are compared. The ORDER-algorithm is shown to be more flexible than the ORDER-b algorithm because it can be based on any state enumeration algorithm for independent failures and multimode components. Experimental results show that the ORDER-c algorithm requires less memory and runs faster.
Persistent Identifierhttp://hdl.handle.net/10722/158075

 

DC FieldValueLanguage
dc.contributor.authorLe, Khiem Ven_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:57:58Z-
dc.date.available2012-08-08T08:57:58Z-
dc.date.issued1990en_US
dc.identifier.citationIeee Global Telecommunications Conference And Exhibition, 1990, v. 2, p. 693-697en_US
dc.identifier.urihttp://hdl.handle.net/10722/158075-
dc.description.abstractORDER-c, an algorithm for enumerating, in order of nonincreasing probability, the states of systems with dependent failures and multimode components is presented. The dependencies and degradations are modeled by the cause-based multimode model, which is reviewed. The ORDER-b algorithm is also reviewed, and the ORDER-b and ORDER-c algorithms are compared. The ORDER-algorithm is shown to be more flexible than the ORDER-b algorithm because it can be based on any state enumeration algorithm for independent failures and multimode components. Experimental results show that the ORDER-c algorithm requires less memory and runs faster.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Global Telecommunications Conference and Exhibitionen_US
dc.titleEfficient enumeration of most probable states for systems with dependent failures and multimode componentsen_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_US
dc.identifier.authorityLi, Victor OK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0025565907en_US
dc.identifier.volume2en_US
dc.identifier.spage693en_US
dc.identifier.epage697en_US
dc.identifier.scopusauthoridLe, Khiem V=7102134077en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats