16404 search results - page 163 / 3281 » A set coverage problem |
103
click to vote
COR
2002
15 years 3 months ago
2002
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These he...
124
click to vote
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
106
Voted
ICCSA
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the ...
127
Voted
ICSEA
2007
IEEE
15 years 9 months ago
2007
IEEE
Automatic test data generation helps testers to validate software against user requirements more easily. Test data can be generated from many sources; for example, experience of t...
131
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...