In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...