This paper presents new sufficient conditions for exponential stability of switched linear systems under arbitrary switching, which involve the commutators (Lie brackets) among the...
Andrei A. Agrachev, Yuliy Baryshnikov, Daniel Libe...
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...
Nikhil R. Devanur, Christos H. Papadimitriou, Amin...
In this paper, firstly we specialise the exact GP schema theorem for one-point crossover to the case of linear structures of variable length, for example binary strings or program...
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
— In this paper, we prove that a discrete-time switched linear system is exponentially stabilizable if and only if there exists a stationary hybrid-control law that consists of a...
Wei Zhang, Alessandro Abate, Michael P. Vitus, Jia...