1424 search results - page 41 / 285 » The Multi-radius Cover Problem |
108
click to vote
QSIC
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
118
click to vote
SODA
2001
ACM
15 years 2 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
126
Voted
AE
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
117
click to vote
SIAMCOMP
1998
15 years 11 days ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
109
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...