Sciweavers

903 search results - page 105 / 181
» On the reduction of a random basis
Sort
View
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
16 years 16 days ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
IJCNN
2006
IEEE
16 years 7 days ago
Ensemble of Neural Network Emulations for Climate Model Physics: The Impact on Climate Simulations
—A new application of the NN ensemble approach is presented. It is applied to NN emulations of model physics in complex numerical climate models, and aimed at improving the accur...
Michael S. Fox-Rabinovitz, Vladimir M. Krasnopolsk...
ATS
2005
IEEE
191views Hardware» more  ATS 2005»
15 years 11 months ago
Low Transition LFSR for BIST-Based Applications
Abstract—This paper presents a low transition test pattern generator, called LT-LFSR, to reduce average and peak power of a circuit during test by reducing the transitions within...
Mohammad Tehranipoor, Mehrdad Nourani, Nisar Ahmed
CEC
2005
IEEE
15 years 11 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
15 years 11 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick