2254 search results - page 4 / 451 » Computing the minimal covering set |
RSA
2011
13 years 4 months ago
2011
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
AAAI
2008
14 years 4 days ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
FCCM
2002
IEEE
14 years 2 months ago
2002
IEEE
FMCAD
2006
Springer
14 years 1 months ago
2006
Springer
In this paper, a new heuristic-based approach is introduced to extract minimally unsatisfiable subformulas (in short, MUSes) of SAT instances. It is shown that it often outperforms...
AAIM
2006
Springer
14 years 3 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...