By Topic

Two strategies in the problem of change detection and isolation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
I. V. Nikiforov ; Univ. de Technol. de Troyes, France

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

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 2 )