The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\) (Q1765774)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The optimal consecutive-k-out-of-n:G line for n 2k |
scientific article; zbMATH DE number 2137680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\) |
scientific article; zbMATH DE number 2137680 |
Statements
The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\) (English)
0 references
23 February 2005
0 references
Reliability
0 references
Consecutive systems
0 references
Optimal assignment
0 references
0.9214273691177368
0 references
0.7998200058937073
0 references
0.7899854779243469
0 references
0.7899854779243469
0 references
0.7819012999534607
0 references
