Sciweavers

4581 search results - page 190 / 917
» Computing Transformation Semigroups
Sort
View
TIT
2008
107views more  TIT 2008»
15 years 6 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
AUTOMATICA
2010
123views more  AUTOMATICA 2010»
15 years 4 months ago
On the computation of linear model predictive control laws
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
Francesco Borrelli, Mato Baotic, Jaroslav Pekar, G...
FORMATS
2010
Springer
15 years 4 months ago
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
Patricia Bouyer, Romain Brenguier, Nicolas Markey
ICCAD
2006
IEEE
96views Hardware» more  ICCAD 2006»
16 years 3 months ago
Loop pipelining for high-throughput stream computation using self-timed rings
We present a technique for increasing the throughput of stream processing architectures by removing the bottlenecks caused by loop structures. We implement loops as self-timed pip...
Gennette Gill, John Hansen, Montek Singh
CONIELECOMP
2004
IEEE
15 years 10 months ago
Representing and Computing Some Configuration Properties for the n-Dimensional Orthogonal Pseudo-Polytopes
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
Antonio Aguilera, Ricardo Pérez-Aguila