Sciweavers

3591 search results - page 14 / 719
» Typing linear constraints
Sort
View
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
14 years 4 months ago
Exact controllability of linear neutral type systems by the moment problem approach
Abstract— The problem of exact null-controllability is considered for a wide class of linear neutral type systems with distributed delay. The main tool of the analysis is the app...
Rabah Rabah, Grigory Sklyar
CSL
2010
Springer
13 years 11 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
CSL
2009
Springer
14 years 5 months ago
Enriching an Effect Calculus with Linear Types
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
IJCNN
2008
IEEE
14 years 4 months ago
Robust adaptive control via neural linearization and four types of compensation
— In this paper, we propose a new type of neural adaptive control via dynamic neural networks. For a class of unknown nonlinear systems, a neural identifierFbased feedback linea...
Wen Yu, Xiaoou Li
HASKELL
2006
ACM
14 years 4 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton