Sciweavers

534 search results - page 60 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
JUCS
2006
104views more  JUCS 2006»
13 years 9 months ago
Introducing the ITP Tool: a Tutorial
: 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 ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
14 years 1 months ago
A symbolic model approach to the digital control of nonlinear time-delay systems
— 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...
Giordano Pola, Pierdomenico Pepe, Maria Domenica D...
ICASSP
2011
IEEE
13 years 21 days ago
On optimal channel training for uplink network MIMO systems
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...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
13 years 9 months ago
Input-to-state stability of switched systems and switching adaptive control
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...
Linh Vu, Debasish Chatterjee, Daniel Liberzon
RTSS
2006
IEEE
14 years 3 months ago
Tightening the Bounds on Feasible Preemption Points
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...
Harini Ramaprasad, Frank Mueller