2531 search results - page 248 / 507 » Group testing in graphs |
181
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
186
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— The proliferation of wireless and mobile devices has fostered the demand of context aware applications, in which location is often viewed as one of the most significant context...
164
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
165
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...
166
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...