232 search results - page 28 / 47 » Termination of linear bounded term rewriting systems |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
JSAC
2007
13 years 7 months ago
2007
Abstract— In this paper we study the effects of practical pilotassisted channel state estimation on the achievable information theoretic data rates (uplink and downlink) in a mul...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
ICCAD
1997
IEEE
13 years 12 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
CDC
2010
IEEE
13 years 2 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...