Sciweavers

3373 search results - page 160 / 675
» Linear transformations on codes
Sort
View
LISP
2002
81views more  LISP 2002»
15 years 6 months ago
Linear Continuation-Passing
Abstract. Continuations can be used to explain a wide variety of control behaviours, including calling/returning (procedures), raising/handling (exceptions), labelled jumping (goto...
Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, Hay...
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...
WMPI
2004
ACM
15 years 12 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
15 years 6 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
HYBRID
2009
Springer
16 years 1 months ago
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
Radu Grosu