From all to (nearly) none
- 期刊名称Cellular Logistics
- 作者Barlow, Lael D; Dacks, Joel B; Wideman, Jeremy G
- 卷第4卷
- 期第1期
- 电子ISSN2159-2799
- 文件大小4620.96KB
- 发表时间2014-01
- DOI10.4161/cl.28114
Reliable gain-scheduled control design for networked control systemsSelvi, Subramaniam; Sakthivel, Rathinasamy; Mathiyalagan, Kalidass; Arunkumar, Arumugham · Complexity · 2014
Delay-dependent robust reliable control for uncertain switched neutral systemsSelvi, Subramaniam; Sakthivel, Rathinasamy; Mathiyalagan, Kalidass · Complexity · 2015
Robust reliable sampled-data <i>H</i> <sub/>∞</sub> control for uncertain stochastic systems with random delaySakthivel, Rathinasamy; Selvi, Subramaniam; Mathiyalagan, Kalidass; Arunkumar, Arumugham · Complexity · 2014
Reliable Mixed H∞ and Passivity-Based Control for Fuzzy Markovian Switching Systems With Probabilistic Time Delays and Actuator FailuresSakthivel, Rathinasamy; Selvi, Subramaniam; Mathiyalagan, Kalidass; Shi, Peng · IEEE Transactions on Cybernetics · 2015
An editorialJoachim von zur Gathen · Computational Complexity · 1991
Instructions for preparing camera-ready manuscriptsComputational Complexity · 1991
Decompositions of algebras over ℝ and ℂWayne Eberly · Computational Complexity · 1991
Improving known solutions is hardDesh Ranjan; Suresh Chari; Pankaj Rohatgi · Computational Complexity · 1993
Parallel pointer machinesStephen A. Cook; Patrick W. Dymond · Computational Complexity · 1993
A deterministic test for permutation polynomialsI. E. Shparlinski · Computational Complexity · 1992
Counting curves and their projectionsJoachim von zur Gathen; Marek Karpinski; Igor Shparlinski · Computational Complexity · 1996-1997
The hardness of approximation: Gap locationErez Petrank · Computational Complexity · 1994