Online Metric Tracking and Smoothing

We consider the online smoothing problem , in which a tracker is required to maintain distance no more than Δ≥0 from a time-varying signal f while minimizing its own movement. The problem is determined by a metric space ( X , d ) with an associated cost function c :ℝ→ℝ. Given a signal f 1 , f 2 ,…∈...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 68; číslo 1; s. 133 - 151
Hlavní autori:	Chen, Sixia, Russell, Alexander
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.01.2014 Springer
Predmet:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Mathematics of Computing Theoretical computing Theory of Computation Online algorithms Randomized algorithms On line Tracking Proximity Metric space Fixed cost Competitiveness Algorithmics Online algorithm Randomized algorithm Time varying system Smoothing Metric Deterministic algorithms
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!