167 search results - page 5 / 34 » A class of polynomially solvable linear complementarity prob... |
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— In this paper, we consider the problems of semiglobal and global internal stabilization of a class of sandwich systems consisting of two linear systems with a saturatio...
ENTCS
2008
13 years 7 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
SAT
2004
Springer
14 years 28 days ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...