Sciweavers

1142 search results - page 75 / 229
» Approximability of Clausal Constraints
Sort
View
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
15 years 6 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho
IEEECIT
2006
IEEE
16 years 12 days ago
ILP-based Scheduling for Asynchronous Circuits in Bundled-Data Implementation
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...
Hiroshi Saito, Nattha Jindapetch, Tomohiro Yoneda,...
TIT
2002
64views more  TIT 2002»
15 years 6 months ago
An information-theoretic and game-theoretic study of timing channels
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for...
James Giles, Bruce Hajek
TCS
2010
15 years 4 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
ICIP
2005
IEEE
16 years 8 months ago
Video summarization for multiple path communication
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...
Zhu Li, Guido M. Schuster, Aggelos K. Katsaggelos