1998 search results - page 13 / 400 » Complexity of the Cover Polynomial |
115
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
109
Voted
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
120
Voted
WWW
2005
ACM
16 years 2 months 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...
87
Voted
DAM
2008
15 years 1 months ago
2008
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...