Sciweavers

190 search results - page 1 / 38
» Isomorph-Free Exhaustive Generation
Sort
View
JAL
1998
85views more  JAL 1998»
13 years 4 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
DAM
2006
81views more  DAM 2006»
13 years 4 months ago
Equivalence-free exhaustive generation of matroid representations
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
Petr Hlinený
VTS
1995
IEEE
94views Hardware» more  VTS 1995»
13 years 8 months ago
Synthesis of locally exhaustive test pattern generators
Optimized locally exhaustive test pattern generators based on linear sums promise a low overhead, but have an irregular structure. The paper presents a new algorithm able to compu...
Günter Kemnitz
ITC
1993
IEEE
110views Hardware» more  ITC 1993»
13 years 9 months ago
Novel Test Pattern Generators for Pseudo-Exhaustive Testing
ÐPseudoexhaustive testing of a combinational circuit involves applying all possible input patterns to all its individual output cones. The testing ensures detection of all detecta...
Rajagopalan Srinivasan, Sandeep K. Gupta, Melvin A...
FASE
2009
Springer
13 years 11 months ago
Reducing the Costs of Bounded-Exhaustive Testing
Abstract. Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test...
Vilas Jagannath, Yun Young Lee, Brett Daniel, Dark...