624 search results - page 54 / 125 » Test set compaction algorithms for combinational circuits |
129
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
141
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
189
click to vote
BMCBI
2011
14 years 11 months ago
2011
Background: In the last decades, microarray technology has spread, leading to a dramatic increase of publicly available datasets. The first statistical tools developed were focuse...
112
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
This paper presents the Routing Cost Valleys (RCV) algorithm – the first published algorithm that simultaneously optimizes all short- and long-path timing constraints in a Field...
102
click to vote
DSN
2005
IEEE
15 years 10 months ago
2005
IEEE
View-oriented group communication is an important and widely used building block for constructing highlyavailable fault-tolerant systems. Unfortunately, groupcommunication based s...