Two strategies in the problem of change detection and isolation

Abstract

The comparison between optimal sequential and nonsequential (fixed-size sample) strategies in the problem of abrupt change detection and isolation is discussed. In particular, we show that sometimes a simple fixed-size sample algorithm is almost as efficient as an optimal sequential algorithm which leads to a burdensome number of arithmetical operations.