16404 search results - page 164 / 3281 » A set coverage problem |
113
click to vote
WSC
2008
15 years 5 months ago
2008
In this study we propose a new method for designing computer experiments inspired by the split plot designs used in physical experimentation. The basic layout is that each set of ...
112
Voted
CCCG
2009
15 years 4 months ago
2009
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
110
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
136
Voted
CP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
140
Voted
ATS
1998
IEEE
15 years 7 months ago
1998
IEEE
We propose a new static test set compaction method based on a careful examination of attributes of fault coverage curves. Our method is based on two key ideas: 1 fault-list and te...