The word Interpretability is becoming more and more frequent in the fuzzy literature. It is admitted as the main advantage of fuzzy systems and it should be given a main role in fu...
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified fram...
Hui Xu, Xianren Wu, Hamid R. Sadjadpour, J. J. Gar...
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...