Results 211 to 220 of about 499,252 (266)
Chem Commun (Camb)Some of the next articles are maybe not open access.
Related searches:
Related searches:
Selecting a Selection Procedure
Management Science, 2007Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. “Best” is defined with respect to the largest mean, but the mean is inferred with statistical sampling, as in simulation optimization. There are a wide variety of procedures, which begs the question of which selection procedure to select. The
Jürgen Branke +2 more
openaire +2 more sources
Collection Management, 2001
Abstract The libraries of OhioLINK-a large Midwest consortium of all Ohio academic libraries-began an experiment in the purchase and use of e-journals in 1998. Discovering that individual libraries were providing on average only around 25% of the available journal literature from major publishers, the OhioLINK consortium began purchasing all publisher ...
openaire +1 more source
Abstract The libraries of OhioLINK-a large Midwest consortium of all Ohio academic libraries-began an experiment in the purchase and use of e-journals in 1998. Discovering that individual libraries were providing on average only around 25% of the available journal literature from major publishers, the OhioLINK consortium began purchasing all publisher ...
openaire +1 more source
Selection Bias and Self-Selection
1987The problem of selection bias in economic and social statistics arises when a rule other than simple random sampling is used to sample the underlying population that is the object of interest. The distorted representation of a true population as a consequence of a sampling rule is the essence of the selection problem.
openaire +1 more source
SIAM Journal on Computing, 1999
Improving a long-standing result of Schönhage, Paterson, and Pippenger [ J. Comput. System Sci., 13 (1976), pp. 184--199] we show that the median of a set containing n elements can always be found using at most $c \cdot n$ comparisons, where ...
Dorit Dor, Uri Zwick
openaire +4 more sources
Improving a long-standing result of Schönhage, Paterson, and Pippenger [ J. Comput. System Sci., 13 (1976), pp. 184--199] we show that the median of a set containing n elements can always be found using at most $c \cdot n$ comparisons, where ...
Dorit Dor, Uri Zwick
openaire +4 more sources