840 search results - page 122 / 168 » Inapproximability of Combinatorial Optimization Problems |
ICDE
2007
IEEE
15 years 11 days ago
2007
IEEE
Tuple dropping, though commonly used for load shedding in most stream operations, is inadequate for m-way, windowed stream joins. The join output rate can be overly reduced becaus...
CP
2009
Springer
14 years 11 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
SARA
2009
Springer
14 years 5 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
IEEEARES
2008
IEEE
14 years 5 months ago
2008
IEEE
We consider a network of remote agent platforms that are tested by roaming spy agents in order to identify those that are malicious, based on the outcome of each agent. It is show...
ISMVL
2006
IEEE
14 years 5 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...