Sciweavers

1312 search results - page 73 / 263
» Formally Optimal Boxing
Sort
View
PR
1998
86views more  PR 1998»
13 years 8 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
ISCAS
2011
IEEE
261views Hardware» more  ISCAS 2011»
13 years 26 days ago
Optimization of area in digit-serial Multiple Constant Multiplications at gate-level
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
Levent Aksoy, Cristiano Lazzari, Eduardo Costa, Pa...
IJCAI
2007
13 years 10 months ago
Model-Based Optimization of Testing through Reduction of Stimuli
The paper presents the theoretical foundations and an algorithm to reduce the efforts of testing physical systems. A test is formally described as a set of stimuli (inputs to the ...
Peter Struss
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
14 years 2 months ago
Development and Application of Design Transformations in ForSyDe
The ForSyDe methodology has been developed for system level design. Starting with a formal specification model, that captures the functionality of the system at a high abstractio...
Ingo Sander, Axel Jantsch, Zhonghai Lu
ICCAD
2006
IEEE
127views Hardware» more  ICCAD 2006»
14 years 6 months ago
Joint design-time and post-silicon minimization of parametric yield loss using adjustable robust optimization
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
Murari Mani, Ashish Kumar Singh, Michael Orshansky