Worst case analysis of nonlinear systems
β Scribed by Fialho, I.J.; Georgiou, T.T.
- Book ID
- 120053798
- Publisher
- IEEE
- Year
- 1999
- Tongue
- English
- Weight
- 620 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0018-9286
- DOI
- 10.1109/9.769372
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
It is well-known that most scheduling problems arising from parallel systems are N N P P-hard, even under very special assumptions. Thus, various suboptimal algorithms, in particular heuristics, were proposed in the literature. Worst-case error bounds are established in this paper for heuristics of