On the Problem of Weighted Max-DL-SAT and its Application to Image Labeling

des algorithmes de reherhe loale dans e adre ave.. trois valeurs

Les meilleurs résultats sont obtenus pour la plus petite ins- tance avec la propagation unitaire ainsi que l’estimation de la borne inférieure (Figure 5) pour laquelle MOMS- JW

The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.. L’archive ouverte pluridisciplinaire HAL, est

In this paper, we first carefully analyze the relationship between these inconsis- tency measures by showing that the inconsistency degrees under 4-valued semantics, 3-value

We consider the problem of computing best excerpts of on- tologies, which are selections of a certain, small number k of axioms that best capture the knowledge regarding a given set

Unfortunately, the example given in Figure 5 shows that it is not possible to build a deterministic algorithm which approximates the ideal point with a performance guarantee when

Furthermore, Algorithm 8 in Section 5 is a kind of polynomial reduction between exact computation and moderately exponential approximation transforming exact algorithms running

APX or DAPX: the class of problems for which there exists a polynomial algorithm achieving standard or differential approximation ratio f ( | x | ) where function f is constant (it