๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational feasibility of structured matching

โœ Scribed by Goel, A.; Bylander, T.


Book ID
117873177
Publisher
IEEE
Year
1989
Tongue
English
Weight
659 KB
Volume
11
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On computational complexity of invalidat
โœ Onur Toker; Jie Chen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

In this paper we study a class of uncertainty model validation=invalidation problems for linear discrete-time systems. We consider models described by a linear fractional transformation (LFT) of modeling uncertainties, which are structured, time invariant or time varying, and are bounded in H โˆž or '