Pages that link to "Item:Q5509339"

The following pages link to A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations (Q5509339):

Displaying 22 items.

• Step-up and step-down methods for testing multiple hypotheses in sequential experiments (Q419332) (← links)
• A sequential elimination procedure for choosing the best population(s) based on multiple testing (Q1116602) (← links)
• Some sequential procedures for ranking multivariate normal populations (Q1222489) (← links)
• An O'Brien-Fleming sequential trial for comparing three treatments (Q1354411) (← links)
• Considering sample means in Rinott's procedure with a Bayesian approach (Q1991285) (← links)
• Pareto set estimation with guaranteed probability of correct selection (Q2030571) (← links)
• Choosing the best arm with guaranteed confidence (Q2096406) (← links)
• Sequential tests of multiple hypotheses controlling type I and II familywise error rates (Q2250703) (← links)
• Active ranking from pairwise comparisons and when parametric assumptions do not help (Q2284367) (← links)
• A sequential procedure for neighborhood selection-of-the-best in optimization via simulation (Q2491793) (← links)
• A two-sample procedure for selecting the population with the largest mean from k normal populations (Q2547784) (← links)
• Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee (Q2661587) (← links)
• A Rejection Principle for Sequential Tests of Multiple Hypotheses Controlling Familywise Error Rates (Q2791825) (← links)
• A Fully Sequential Elimination Procedure for Indifference-Zone Ranking and Selection with Tight Bounds on Probability of Correct Selection (Q2931710) (← links)
• Indifference-Zone-Free Selection of the Best (Q2957472) (← links)
• Conditions under which F. {N } = for tong's adaptive solution to ranking and selection problems (Q3308866) (← links)
• Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments (Q5031020) (← links)
• Solving Large-Scale Fixed-Budget Ranking and Selection Problems (Q5060777) (← links)
• Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing (Q5084671) (← links)
• Tractable Sampling Strategies for Ordinal Optimization (Q5131546) (← links)
• Simple Bayesian Algorithms for Best-Arm Identification (Q5144786) (← links)
• On the finite-sample statistical validity of adaptive fully sequential procedures (Q6106982) (← links)