1433 search results - page 49 / 287 » On Covering Problems of Rado |
113
click to vote
COMGEO
2011
ACM
14 years 6 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...
102
click to vote
FOCS
2008
IEEE
15 years 27 days 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...
115
click to vote
AI
2001
Springer
15 years 4 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...
127
click to vote
TCBB
2011
14 years 6 months ago
2011
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...
IJCGA
1998
14 years 11 months ago
1998
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...