Sciweavers

744 search results - page 31 / 149
» Observations on the Decidability of Transitions
Sort
View
JAIR
2007
146views more  JAIR 2007»
13 years 9 months ago
Reasoning with Very Expressive Fuzzy Description Logics
It is widely recognized today that the management of imprecision and vagueness will yield more intelligent and realistic knowledge-based applications. Description Logics (DLs) are...
Giorgos Stoilos, Giorgos B. Stamou, Jeff Z. Pan, V...
AI
2008
Springer
13 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
DAC
1995
ACM
14 years 18 days ago
Extreme Delay Sensitivity and the Worst-Case Switching Activity in VLSI Circuits
Abstract We observe that the switching activity at a circuit node, also called the transition density, can be extremely sensitive to the circuit internal delays. As a result, sligh...
Farid N. Najm, Michael Y. Zhang
AUTOMATICA
2006
81views more  AUTOMATICA 2006»
13 years 9 months ago
Discrete state estimators for systems on a lattice
We address the problem of estimating discrete variables in a class of deterministic transition systems in which the continuous variables are available for measurement. We propose ...
Domitilla Del Vecchio, Richard M. Murray, Eric Kla...
CORR
2010
Springer
64views Education» more  CORR 2010»
13 years 9 months ago
High-Dimensional Matched Subspace Detection When Data are Missing
We consider the problem of deciding whether a highly incomplete signal lies within a given subspace. This problem, Matched Subspace Detection, is a classical, wellstudied problem w...
Laura Balzano, Benjamin Recht, Robert Nowak