418 search results - page 21 / 84 » On the Adders with Minimum Tests |
TAP
2010
Springer
13 years 5 months ago
2010
Springer
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
EXPCS
2007
13 years 11 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
AAAI
1998
13 years 9 months ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
JCO
2007
13 years 7 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...