✦ 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
DOI: 10.1109/34.41369

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational Design of Hierarchically S

Computational Design of Hierarchically Structured Materials

✍ Olson, G. B. 📂 Article 📅 1997 🏛 American Association for the Advancement of Scienc 🌐 English ⚖ 502 KB

Computational modeling of nano-structure

Computational modeling of nano-structured glass fibers

✍ A. Alavinasab; R. Jha; G. Ahmadi; C. Cetinkaya; I. Sokolov 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Computational Complexity of Simultaneous

Computational Complexity of Simultaneous Elementary Matching Problems

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 191 KB

Matching Computer-Based Information Syst

Matching Computer-Based Information Systems with Organizational Structures

✍ Richard Leifer 📂 Article 📅 1988 🏛 Association for Information Systems 🌐 English ⚖ 313 KB

On computational complexity of invalidat

On computational complexity of invalidating structured uncertainty models

✍ 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 '

Multi-scale computational homogenization

Multi-scale computational homogenization of structured thin sheets

✍ Geers, M G D; Coenen, E W C; Kouznetsova, V G 📂 Article 📅 2007 🏛 Institute of Physics 🌐 English ⚖ 783 KB