4903 search results - page 10 / 981 » The Set Covering Machine |
SIROCCO
2010
13 years 9 months ago
2010
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
ANTSW
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
ICCTA
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
LREC
2008
13 years 9 months ago
2008
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...