5624 search results - page 60 / 1125 » On Conditional Covering Problem |
149
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
147
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
181
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
172
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
170
click to vote
AI
2001
Springer
15 years 10 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...