823 search results - page 10 / 165 » Stateful Subset Cover |
SIAMDM
1998
13 years 10 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
DAC
1999
ACM
14 years 2 months ago
1999
ACM
Approximate reachability techniques trade o accuracy for the capacity to deal with bigger designs. Cho et al 4 proposed partitioning the set of state bits into mutually disjoint s...
JWSR
2007
13 years 10 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
HEURISTICS
1998
13 years 10 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
FCT
2009
Springer
14 years 5 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...