For a scalar Gauss-Markov process watched by constant-gain remote estimators, scheduling the packet with the smallest age-and-precision index minimizes the expected cumulative estimation error.
Applying update streams in a soft real-time database system,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal Information Updating based on Value of Information
For a scalar Gauss-Markov process watched by constant-gain remote estimators, scheduling the packet with the smallest age-and-precision index minimizes the expected cumulative estimation error.