96 search results - page 2 / 20 » Linearity, Non-determinism and Solvability |
MP
2006
13 years 6 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
This paper presents new sufficient conditions for exponential stability of switched linear systems under arbitrary switching, which involve the commutators (Lie brackets) among the...
WG
1998
Springer
13 years 10 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
ICML
2010
IEEE
13 years 7 months ago
2010
IEEE
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
CORR
2010
Springer
13 years 6 months ago
2010
Springer