3600 search results - page 140 / 720 » The settling-time reducibility ordering |
156
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In order to handle classification problems with real-valued attributes using discretization algorithms it is necessary to obtain a good and reduced set of cut points in order to l...
150
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
— The authors present a number of complete cores which are specially tailored for the low power implementation of FIR filters executed using block processing. The paper reveals t...
171
click to vote
ISVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random...
177
click to vote
VTS
2003
IEEE
15 years 11 months ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
159
click to vote
CAEPIA
2003
Springer
15 years 11 months ago
2003
Springer
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...