Consider a binary tree, to the vertices of which are assigned independent Bernoulli random variables with mean p ≤ 1/2. How many of these Bernoullis one must look at in order to find a path of length ...

We describe the cyclic coordinate-exchange algorithm for constructing D-optimal and linear-optimal experimental designs. The algorithm uses a variant of the Gauss-Southwell cyclic coordinate-descent ...