5130 search results - page 950 / 1026 » Constraint Query Languages |
101
click to vote
CODES
2007
IEEE
15 years 7 months ago
2007
IEEE
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
104
Voted
HPDC
2007
IEEE
15 years 7 months ago
2007
IEEE
With the emergence of Service-based architectures, management of an application which comprises of a large number of distributed services becomes difficult as resources appear, mo...
99
Voted
COORDINATION
2007
Springer
15 years 7 months 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...
82
Voted
CP
2007
Springer
15 years 7 months 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...
CP
2007
Springer
15 years 7 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...