7092 search results - page 475 / 1419 » Parallelizing constraint programs |
128
click to vote
CDES
2006
15 years 5 months ago
2006
- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores th...
131
click to vote
ACL
1997
15 years 5 months ago
1997
This paper presents a new approach to bitext correspondence problem (BCP) of noisy bilingual corpora based on image processing (IP) techniques. By using one of several ways of est...
145
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
174
click to vote
AOSD
2011
ACM
14 years 11 months ago
2011
ACM
Software systems are increasingly being built as compositions of reusable artifacts (components, frameworks, toolkits, plug-ins, APIs, etc) that have non-trivial usage constraints...
117
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...