Minimal path sets with known size in a consecutive-2-out-of-n : f system

Simple item page
dc.contributor.authorSeth, Arvind
dc.contributor.authorSadegh, Mohammad Khanjari
dc.date.accessioned2013-06-17T10:11:19Z
dc.date.available2013-06-17T10:11:19Z
dc.date.issued2001
dc.identifier.citationOpsearch,v.38,no.4,p.352-371en_US
dc.identifier.urihttp://hdl.handle.net/10263/5452
dc.language.isoenen_US
dc.subject2-out-of-n:F sysytemen_US
dc.subjectMinimal path setsen_US
dc.titleMinimal path sets with known size in a consecutive-2-out-of-n : f systemen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
O-38-4-2001-P352-371.pdf
Size:
531.88 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Mathematics and Statistics