Two strategies in the problem of change detection and isolation - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 1997

Two strategies in the problem of change detection and isolation

(1)
1

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.
Not file

Dates and versions

hal-02365833 , version 1 (15-11-2019)

Identifiers

Cite

Igor V. Nikiforov. Two strategies in the problem of change detection and isolation. IEEE Transactions on Information Theory, 1997, 43 (2), pp.770-776. ⟨10.1109/18.556138⟩. ⟨hal-02365833⟩
8 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More