Abstract We propose the Embarrassingly Parallel Search, a simple and efficient method for
solving constraint programming problems in parallel. We split the initial problem into a huge …

As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …

The computing industry is currently facing a major architectural shift. Extra computing power
is not coming anymore from higher processor frequencies, but from a growing number of …

We introduce an Embarrassingly Parallel Search (EPS) method for solving constraint
problems in parallel, and we show that this method matches or even outperforms state-of-the …

Abstract Formal Concept Analysis (FCA) is a data analysis technique with applications in
data mining, artificial intelligence, software engineering, etc. The algorithms for FCA are …

We propose an adaptation of the Embarrassingly Parallel Search (EPS) method for data
centers. EPS is a simple but efficient method for parallel solving of CSPs. EPS decomposes …

Constraint programming (CP) is an efficient technique for solving combinatorial optimization
problems. In CP a problem is defined over variables that take values in domains and …

In a Mobile Ad-Hoc Network environment, wireless devices have finite resources such as
memory, energy and they work within the wireless constraints such as limited bandwidth and …

Exact combinatorial search is essential to a wide range of application areas including
constraint optimisation, graph matching, and computer algebra. Solutions to combinatorial …

Abstract Multi-valued Decision Diagrams (MDDs) have been extensively studied in the last
ten years. Recently, efficient algorithms implementing operators such as reduction, union …