13841 search results - page 232 / 2769 » Algorithms and Constraint Programming |
163
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
176
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
208
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
184
click to vote
IPCO
2008
15 years 8 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
139
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...