Sciweavers

392 search results - page 21 / 79
» Reversal Complexity Revisited
Sort
View
CSR
2007
Springer
14 years 1 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
ICCAD
1996
IEEE
133views Hardware» more  ICCAD 1996»
13 years 11 months ago
Basic concepts for an HDL reverse engineering tool-set
Designer's productivity has become the key-factor of the development of electronic systems. An increasing application of design data reuse is widely recognized as a promising...
Gunther Lehmann, Bernhard Wunder, Klaus D. Mü...
COR
2007
133views more  COR 2007»
13 years 7 months ago
Reverse logistics network design with stochastic lead times
This work is concerned with the efficient design of a reverse logistics network using an extended version of models currently found in the literature. Those traditional, basic mo...
Kris Lieckens, Nico Vandaele
CGO
2007
IEEE
14 years 1 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...