Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
Alexander I. Barvinok, Zur Luria, Alex Samorodnits...
Reader preference, writer preference, and task-fair reader-writer locks are shown to cause undue blocking in multiprocessor real-time systems. Phase-fair reader writer locks, a ne...
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
We deal with dynamic equations on time scales, where we characterize the positivity of a system. Uniform exponential stability of a system is determined by the spectrum of its mat...
T. S. Doan, A. Kalauch, Stefan Siegmund, Fabian Wi...
Thanks to the major evolutions in the communication technologies and in order to deal with a continuous increase in systems complexity, current applications have to cooperate to ac...
Mohammed Nadhmi Miladi, Fatma Krichen, Mohamed Jma...