Sciweavers

3424 search results - page 375 / 685
» Automated Testing of Classes
Sort
View
CC
2007
Springer
158views System Software» more  CC 2007»
15 years 6 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner
TIT
2008
102views more  TIT 2008»
15 years 6 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
JAL
1998
85views more  JAL 1998»
15 years 6 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
SIGOPS
1998
378views more  SIGOPS 1998»
15 years 6 months ago
Introducing Empirical Investigation in Undergraduate Operating Systems
Abstract: The undergraduate operating systems course can provide students with a valuable introduction to empirical testing and experimentation. This paper announces the availabili...
Steven Robbins
TIT
2010
148views Education» more  TIT 2010»
15 years 1 months ago
Compressed genotyping
Abstract--Over the past three decades we have steadily increased our knowledge on the genetic basis of many severe disorders. Nevertheless, there are still great challenges in appl...
Yaniv Erlich, Assaf Gordon, Michael Brand, Gregory...