624 search results - page 80 / 125 » Test set compaction algorithms for combinational circuits |
142
click to vote
VLSID
1998
IEEE
15 years 8 months ago
1998
IEEE
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
128
click to vote
FPGA
2006
ACM
15 years 8 months ago
2006
ACM
Embedded memory blocks are important resources in contemporary FPGA devices. When targeting FPGAs, application designers often specify high-level memory functions which exhibit a ...
114
click to vote
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
132
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
147
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
—Default ARTMAP combines winner-take-all category node activation during training, distributed activation during testing, and a set of default parameter values that define a read...