Add to ORKGChebyshev Type Lower Bounds for the Probability of Correct Selection, I: The Location Problem with One Observation from each of Two Population
summary:In this paper properties of some ranking and selection procedures based on robust $L$-estima...
In this paper we consider the problem of deciding which of two populations \pi_1 and \pi_2 has the l...
This article investigates various local operators in a discrete (1, #)-setting applied to lowdimensi...
We extend the results of Gupta and Liang (1998), derived for location parameters, to obtain lower co...
In this paper we establish lower bounds for average sample size in procedures for selecting a popula...
© 2014 Society for Industrial and Applied Mathematics. Some bounds for the average sample size are e...
summary:The problem of selecting a subset of polulations containing the population with the largest ...
This thesis deals with some statistical selection and ranking problems. Classical subset selection p...
Key words Subset selection selection probability of correct selection loss function best popula...
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first t...
Confidence statements about location (or scale) parameters associated with k populations, which may ...
© 2017 Taylor & Francis Group, LLC. In this article, lower bounds for expected sample size of sequ...
Ensino Médio::MatemáticaChebyshev's Rule establishes a lower bound on the fraction of points in a sa...
In selection problems the usual loss function is the 0-1 one, i.e. the selection goal is to bound ,...
Solutions to combinatorial optimization problems, such as problems of locating facilities, frequentl...
summary:In this paper properties of some ranking and selection procedures based on robust $L$-estima...
In this paper we consider the problem of deciding which of two populations \pi_1 and \pi_2 has the l...
This article investigates various local operators in a discrete (1, #)-setting applied to lowdimensi...
We extend the results of Gupta and Liang (1998), derived for location parameters, to obtain lower co...
In this paper we establish lower bounds for average sample size in procedures for selecting a popula...
© 2014 Society for Industrial and Applied Mathematics. Some bounds for the average sample size are e...
summary:The problem of selecting a subset of polulations containing the population with the largest ...
This thesis deals with some statistical selection and ranking problems. Classical subset selection p...
Key words Subset selection selection probability of correct selection loss function best popula...
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first t...
Confidence statements about location (or scale) parameters associated with k populations, which may ...
© 2017 Taylor & Francis Group, LLC. In this article, lower bounds for expected sample size of sequ...
Ensino Médio::MatemáticaChebyshev's Rule establishes a lower bound on the fraction of points in a sa...
In selection problems the usual loss function is the 0-1 one, i.e. the selection goal is to bound ,...
Solutions to combinatorial optimization problems, such as problems of locating facilities, frequentl...
summary:In this paper properties of some ranking and selection procedures based on robust $L$-estima...
In this paper we consider the problem of deciding which of two populations \pi_1 and \pi_2 has the l...
This article investigates various local operators in a discrete (1, #)-setting applied to lowdimensi...