9572 search results - page 43 / 1915 » Cover Algorithms and Their Combination |
126
click to vote
CIAC
2006
Springer
15 years 3 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...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
CDES
2006
15 years 1 months ago
2006
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
SIGSOFT
2007
ACM
16 years 16 days ago
2007
ACM
The increasing complexity of configurable software systems creates a need for more intelligent sampling mechanisms to detect and locate failure-inducing dependencies between confi...
100
click to vote
WWW
2005
ACM
16 years 14 days ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...