Sciweavers

8094 search results - page 52 / 1619
» Improvements in Formula Generalization
Sort
View
AUTOMATICA
2002
69views more  AUTOMATICA 2002»
13 years 8 months ago
Null controllable region of LTI discrete-time systems with input saturation
We present a formula for the extremes of the null controllable region of a general LTI discrete-time system with bounded inputs. For an nth order system with only real poles (not ...
Tingshu Hu, Daniel E. Miller, Li Qiu
TIT
1998
63views more  TIT 1998»
13 years 8 months ago
Operational Capacity and Pseudoclassicality of a Quantum Channel
We explore some basic properties of coding theory of a general quantum communication channel and its operational capacity, including (1) adaptive measurement with feedback code, (...
Akio Fujiwara, Hiroshi Nagaoka
SAT
2005
Springer
129views Hardware» more  SAT 2005»
14 years 2 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
JANCL
2008
170views more  JANCL 2008»
13 years 9 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
ICC
2009
IEEE
145views Communications» more  ICC 2009»
13 years 6 months ago
End-to-End Delay Approximation in Cascades of Generalized Processor Sharing Schedulers
Abstract This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Generalize...
Paolo Giacomazzi, Gabriella Saddemi