16404 search results - page 169 / 3281 » A set coverage problem |
106
Voted
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
108
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
132
Voted
ASP
2001
Springer
15 years 8 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
164
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
136
Voted
TAMC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...