Sciweavers

1916 search results - page 70 / 384
» Reasoning with class algebra
Sort
View
81
Voted
AUTOMATICA
2010
122views more  AUTOMATICA 2010»
15 years 25 days ago
On the algebraic characterization of invariant sets of switched linear systems
In this paper, a suitable LaSalle principle for continuous-time linear switched systems is used to characterize invariant sets and their associated switching laws. An algorithm to...
Pierre Riedinger, Mario Sigalotti, Jamal Daafouz
96
Voted
TIT
2008
83views more  TIT 2008»
15 years 18 days ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
IGPL
2011
14 years 4 months ago
Interpolation and FEP for logics of residuated algebras
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic oper...
Wojciech Buszkowski
107
Voted
CSL
2005
Springer
15 years 6 months ago
On Deciding Topological Classes of Deterministic Tree Languages
Abstract. It has been proved by Niwi´nski and Walukiewicz that a deterministic tree language is either Π1 1 -complete or it is on the level Π0 3 of the Borel hierarchy, and that...
Filip Murlak
86
Voted
EHCI
2001
15 years 2 months ago
Detecting Multiple Classes of User Errors
Abstract. Systematic user errors commonly occur in the use of interactive systems. We describe a formal reusable user model implemented in higher-order logic that can be used for m...
Paul Curzon, Ann Blandford