5100 search results - page 356 / 1020 » The Linear Complexity of a Graph |
132
click to vote
APPML
2010
15 years 6 months ago
2010
Abstract. We study existence and qualitative properties of solutions for the abstract fractional relaxation equation (0.1) u (t) - AD t u(t) + u(t) = f(t), 0 < < 1, t 0, u(...
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
142
click to vote
ENTCS
2008
15 years 6 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
154
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
138
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We consider source coding with fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding wit...