706 search results - page 126 / 142 » Super Solutions in Constraint Programming |
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
The Cell processor offers substantial computational power which can be effectively utilized only if application design and implementation are tuned to the Cell architecture. In th...
109
click to vote
SECON
2007
IEEE
15 years 6 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
CP
2007
Springer
15 years 5 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 5 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...
112
click to vote
EDCC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...