26 search results - page 1 / 6 » The minimal covering set in large tournaments |
SCW
2012
IEEE
12 years 15 days ago
2012
IEEE
MSS
2008
IEEE
13 years 4 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
AAAI
2008
13 years 7 months 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...
RSA
2011
12 years 11 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...
ICDM
2002
IEEE
13 years 10 months ago
2002
IEEE
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...