5624 search results - page 98 / 1125 » On Conditional Covering Problem |
154
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
TCP-nets are an extension of CP-nets which allow the expression of conditional relative importance of pairs of variables. In this paper it is shown that a simple logic of condition...
167
click to vote
IPL
2002
15 years 6 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
145
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
134
click to vote
UAI
2004
15 years 7 months ago
2004
We formulate and prove an axiomatic characterization of conditional information geometry, for both the normalized and the nonnormalized cases. This characterization extends the ax...