Sciweavers

1502 search results - page 228 / 301
» Computational Realizations of Living Systems
Sort
View
LICS
2003
IEEE
15 years 10 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
RTSS
2003
IEEE
15 years 10 months ago
A Dynamic Voltage Scaling Algorithm for Sporadic Tasks
Dynamic voltage scaling (DVS) algorithms save energy by scaling down the processor frequency when the processor is not fully loaded. Many algorithms have been proposed for periodi...
Ala' Qadi, Steve Goddard, Shane Farritor
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 4 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ICASSP
2011
IEEE
14 years 8 months ago
Fast orthogonal decomposition of Volterra cubic kernels using oblique unfolding
Discrete-time Volterra modeling is a central topic in many application areas and a large class of nonlinear systems can be modeled using high-order Volterra series. The problem wi...
Rémy Boyer, Roland Badeau, Gérard Fa...
DAC
2002
ACM
16 years 5 months ago
Guaranteed passive balancing transformations for model order reduction
The major concerns in state-of-the-art model reduction algorithms are: achieving accurate models of sufficiently small size, numerically stable and efficient generation of the mod...
Joel R. Phillips, Luca Daniel, Luis Miguel Silveir...