190 search results - page 4 / 38 » Isomorph-Free Exhaustive Generation |
96
Voted
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
KBSE
2007
IEEE
15 years 6 months ago
2007
IEEE
We present CESE, a tool that combines exhaustive enumeration of test inputs from a structured domain with symbolic execution driven test generation. We target programs whose valid...
90
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we consider the queueing performance of a subscriber station for IEEE802.16e random access protocol with bulk transmissions which is allowed with an ARQ protocol...
115
Voted
FSE
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we present a distinguisher targeting towards irregularly clocked filter generators. The attack is applied on the irregularly clocked stream cipher called LILI-II. LI...
91
Voted
IJCAI
1997
15 years 1 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...