534 search results - page 60 / 107 » Proving Termination of Rewrite Systems Using Bounds |
123
Voted
JUCS
2006
15 years 3 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
115
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper we propose an approach to control design of nonlinear time–delay systems, which is based on the construction of symbolic models, where each symbolic state and e...
141
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We study a multi-cell frequency-selective fading uplink channel from K user terminals (UTs) to B base stations (BSs). The BSs, assumed to be oblivious of the applied encoding sche...
140
Voted
AUTOMATICA
2007
15 years 3 months ago
2007
In this paper we prove that a switched nonlinear system has several useful ISS-type properties under average dwell-time switching signals if each constituent dynamical system is I...
143
Voted
RTSS
2006
IEEE
15 years 9 months ago
2006
IEEE
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...