✦ LIBER ✦

On the time complexity of worst-case system identification

✍ Scribed by K. Poolla; A. Tikku

Book ID: 126684133
Publisher: IEEE
Year: 1994
Tongue: English
Weight: 644 KB
Volume: 39
Category: Article
ISSN: 0018-9286
DOI: 10.1109/9.284870

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Information-Based Complexity and Nonpara

Information-Based Complexity and Nonparametric Worst-Case System Identification

✍ M. Milanese; A. Vicino 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Sample complexity of worst-case H∞-ident

Sample complexity of worst-case H∞-identification

✍ K.J. Harrison; J.A. Ward; D.K. Gamble 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 311 KB

The sample complexity of worst-case iden

The sample complexity of worst-case identification of FIR linear systems

✍ Munther A Dahleh; Theodore V Theodosopoulos; John N Tsitsiklis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 588 KB

On the Single-Operation Worst-Case Time

On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem

✍ Blum, Norbert 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 430 KB

Worst-case identification of nonlinear f

Worst-case identification of nonlinear fading memory systems

✍ Munther A. Dahleh; Eduardo D. Sontag; David N.C. Tse; John N. Tsitsiklis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 786 KB

In this paper, the problem of asymptotic identification for fading memory systems in the presence of bounded noise is studied. For any experiment, the worst-case error is characterized in terms of the diameter of the worst-case uncertainty set. Optimal inputs that minimize the radius of uncertainty

On the Probablistic Worst-Case Time of `

On the Probablistic Worst-Case Time of ``Find''

✍ L. Devroye 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 142 KB