624 search results - page 59 / 125 » Test set compaction algorithms for combinational circuits |
147
click to vote
AI
2001
Springer
15 years 8 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
110
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Speaker identification is a well-established research problem but has not been a major application used in gaming scenarios. In this paper, we propose a new algorithm for the ope...
126
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
158
click to vote
ITC
2003
IEEE
15 years 9 months ago
2003
IEEE
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
109
click to vote
TCAD
2008
15 years 4 months ago
2008
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...