1159 search results - page 183 / 232 » Binary Decision Graphs |
127
click to vote
AAAI
1994
15 years 4 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
114
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
114
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes. I. THE GOLAY CODE IN STAR...
133
click to vote
DISOPT
2007
15 years 3 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...