130 search results - page 16 / 26 » Binary Representations for General CSPs |
MICAI
2007
Springer
14 years 2 months ago
2007
Springer
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
RISE
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
ISMVL
2000
IEEE
14 years 1 months ago
2000
IEEE
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than t...
FOGA
2007
13 years 10 months ago
2007
Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined using the distance associated to the search space in ...