16404 search results - page 729 / 3281 » A set coverage problem |
179
click to vote
DM
2010
15 years 7 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
140
click to vote
DM
2008
15 years 7 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
186
click to vote
VLSISP
2002
15 years 7 months ago
2002
In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and...
194
click to vote
JDCTA
2010
15 years 2 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
190
Voted
ADMI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study the problem of predictive data mining in the competitive multi-agent setting, in which each agent is assumed to have some partial knowledge needed for correctly ...