2698 search results - page 79 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
133
Voted
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
132
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
96
Voted
WALCOM
2010
IEEE
15 years 9 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
134
Voted
IJAR
2010
15 years 1 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
162
Voted
CODCRY
2011
Springer
14 years 6 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...