Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Abstract. One of the fastest evolving field among teaching and learning research is students' performance evaluation. Computer based testing systems are increasingly adopted b...
We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a mo...
Using multimodality in a computing system is advantageous in the sense that it makes computing more accessible to a wide range of users including those with impairments. Our work ...
Ali Awde, Moeiz Miraoui, Chakib Tadj, Yacine Belli...
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...