7092 search results - page 53 / 1419 » Parallelizing constraint programs |
WLP
2004
Springer
14 years 2 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
CP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
SCP
1998
13 years 8 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
IPCV
2007
13 years 10 months ago
2007
- The shrunk dimension of electronic devices leads to more stringent requirement on process control and quality assurance of their fabrication. For instance, direct die-to-die bond...
APPT
2009
Springer
14 years 3 months ago
2009
Springer
SIMD extension is one of the most common and effective technique to exploit data-level parallelism in today’s processor designs. However, the performance of SIMD architectures i...