1410 search results - page 60 / 282 » Proving theorems by reuse |
ACSD
2001
IEEE
14 years 1 months ago
2001
IEEE
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
GC
2007
Springer
13 years 10 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper addresses the problem of establishing stability of interconnections of integral input-to-state stable (iISS) systems. Recently, the small-gain theorem for input-tostate ...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
The Shannon-McMillan-Breiman theorem asserts that the sample entropy of a stationary and ergodic stochastic process converges to the entropy rate of the same process almost surely...
JCT
2011
13 years 5 months ago
2011
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...