Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blon...
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...