1978
DOI: 10.1080/03610927808827671
|View full text |Cite
|
Sign up to set email alerts
|

On two-stage selection procedures and related probability-inequalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
237
0
2

Year Published

1996
1996
2016
2016

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 400 publications
(239 citation statements)
references
References 2 publications
0
237
0
2
Order By: Relevance
“…But comparisons of all pairs of differences after each incremental replication can create a significant coordination bottleneck: When P > k not all available processors will even be used; and when k P all processors will be repeatedly idle during the nontrivial work of doing k(k − 1)/2 comparisons. Contrast this with a simple two-stage procedure, such as Rinott (1978), that can be implemented to avoid any coordination at all because the number of replications generated from scenario x i depends only on scenario x i . The penalty is that substantially more replications are needed to select the best for typical problems, which may limit the size of problem that can be solved in a timely manner, or greatly increase the cost for processors when the number of scenarios k is huge and much larger than P.…”
Section: Sensitivitymentioning
confidence: 99%
“…But comparisons of all pairs of differences after each incremental replication can create a significant coordination bottleneck: When P > k not all available processors will even be used; and when k P all processors will be repeatedly idle during the nontrivial work of doing k(k − 1)/2 comparisons. Contrast this with a simple two-stage procedure, such as Rinott (1978), that can be implemented to avoid any coordination at all because the number of replications generated from scenario x i depends only on scenario x i . The penalty is that substantially more replications are needed to select the best for typical problems, which may limit the size of problem that can be solved in a timely manner, or greatly increase the cost for processors when the number of scenarios k is huge and much larger than P.…”
Section: Sensitivitymentioning
confidence: 99%
“…The two-stage procedure of Rinott (1978) has been widely studied and applied. Let n 0 be the number of initial replications or batches.…”
Section: The Two-stage Rinott Proceduresmentioning
confidence: 99%
“…where z is the smallest integer that is greater than or equal to the real number z, and h (which depends on k, P * , and n 0 ) is a constant that solves Rinott's (1978) integral (h can be calculated by the FORTRAN program rinott in Bechhofer et al (1995), or can be found from the tables in Wilcox (1984)). We then compute the overall sample meansX i (N i ) = N i j=1 X ij /N i , and select the design with the smallestX i (N i ) as the best one.…”
Section: The Two-stage Rinott Proceduresmentioning
confidence: 99%
“…R&S can handle comparison with not common variance. We will use Rinott's (1978), it used when variances are unknown; it is two-stage R&S procedure; the two stages of sampling guaranteed PCS. Rinott's (1978) procedure:…”
Section: Pilot Experiments (Batch Mean)mentioning
confidence: 99%
“…Thus we utilized a RankingSelection procedure of Rinott, (1978), to select the system with the largest expected performance measures (Bechhofer 1995, Kim-Nelson 2001, Nelson-Miler 1995.…”
Section: Discussi~m and Conclusionmentioning
confidence: 99%