As the architectural walls drive the number of parallel cores in multicore systems up, it
becomes harder to maintain cache coherence across all of the physical memory and all …

We present a scalable parallel solver for numerical constraint satisfaction problems
(NCSPs). Our parallelization scheme consists of homogeneous worker solvers, each of …

Interval constraint satisfaction problems (CSPs) are typically hard to solve and, therefore,
desirable candidates for acceleration. Although there were successful attempts in this area …

With parallelism becoming the standard in computer design, research on parallel constraint
solving technique is of vital importance for enhancing the performance of constraint solving …

Nowadays, it has become increasingly hard for constraint solving to keep profiting from the
performance improvement of uniprocessor due to the death of Moore's Law. Consequently …