2042 search results - page 60 / 409 » Variable Number of |
CP
2007
Springer
15 years 6 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
96
Voted
TCS
2008
15 years 15 days ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
113
click to vote
AAAI
2012
13 years 3 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
105
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
110
click to vote
ECAI
2000
Springer
15 years 5 months ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...