One-sided precedence monitoring schemes for unknown shift sizes using generalized <i>2</i>-<i>of</i>-(<i>h+</i>1) and <i>w-of-w</i> improved runs-rules (Q5081027)
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: One-sided precedence monitoring schemes for unknown shift sizes using generalized 2-of-(h+1) and w-of-w improved runs-rules |
scientific article; zbMATH DE number 7535565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-sided precedence monitoring schemes for unknown shift sizes using generalized <i>2</i>-<i>of</i>-(<i>h+</i>1) and <i>w-of-w</i> improved runs-rules |
scientific article; zbMATH DE number 7535565 |
Statements
One-sided precedence monitoring schemes for unknown shift sizes using generalized <i>2</i>-<i>of</i>-(<i>h+</i>1) and <i>w-of-w</i> improved runs-rules (English)
0 references
1 June 2022
0 references
distribution-free
0 references
order statistic
0 references
precedence statistic
0 references
runs-rules
0 references
case U
0 references
Markov chain
0 references
phase I
0 references
phase II
0 references
0 references
0 references
0 references
0 references
