1941 search results - page 54 / 389 » On the Hardness of Approximate Reasoning |
ALMOB
2006
14 years 12 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
ANOR
2004
14 years 11 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
APPML
2007
14 years 12 months ago
2007
We establish existence, uniqueness and a priori bounds for the half moment entropy approximation to radiative heat transfer. The bounds are physically reasonable and underline the...
100
click to vote
CC
2006
Springer
14 years 12 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
IPL
2008
14 years 12 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...