Technical Note—A Note on the Stochastic Shortest Route Problem

Variations on the Stochastic Shortest Path Problem

In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the distribution of the length of paths reaching a given target, rather than simply minimizing its expected value. The concepts and algorithms that we propose here ...

A note on k-shortest paths problem

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this paper, we generalize this to shortest k edge-disjoint s-t paths for any positive integer k.

A Note on the Shortest Lattice Vector Problem

We show that the problem of deciding whether a given rational lattice L has a vector of length less than some given value r is NP-hard under randomized reductions, even under the promise that L has exactly zero or one vector of length less than r.

Preparation Zirconia Toughened Alumina by Deflocculation-Flocculation Route (TECHNICAL NOTE).

Partially stabilized zirconia (PSZ) agglomerate toughened alumina has been prepared by the "deflocculation-flocculation" technique, using 2 and 3 mol. % Y2O3-doped zirconia powders. Samples containing up to about 30 vol.% zirconia were obtained. The resulting microstructure seems to be mainly influenced by the physical properties of the starting powders, e.g. agglomerate size and the specific s...

The Shortest Route