4903 search results - page 45 / 981 » The Set Covering Machine |
163
click to vote
EJC
2010
15 years 6 months ago
2010
In this paper, we investigate some properties of partial covers of PG(n, q). We show that a set of q + a hyperplanes, q 81, a < (q - 1)/3, or q > 13 and a (q - 10)/4, that...
135
click to vote
COR
2007
15 years 5 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
149
click to vote
FUIN
2007
15 years 5 months ago
2007
Different generalizations to the case of coverings of the standard approach to entropy applied to partitions of a finite universe X are explored. In the first approach any cover...
173
click to vote
COCOON
2005
Springer
15 years 11 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...
178
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...