2593 search results - page 426 / 519 » constraints 2007 |
165
click to vote
COORDINATION
2007
Springer
16 years 16 days ago
2007
Springer
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
142
click to vote
CP
2007
Springer
16 years 16 days ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
157
click to vote
CP
2007
Springer
16 years 16 days 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...
138
click to vote
CP
2007
Springer
16 years 16 days ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
172
click to vote
CP
2007
Springer
16 years 16 days ago
2007
Springer
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...