—The major challenge of p-cycle network design resides in finding an optimal set of p-cycles protecting the network for a given working capacity. Existing solutions (exact and h...
Hamza Drid, Bernard Cousin, Samer Lahoud, Mikl&oac...
We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period...
Marcos Kawazoe Aguilera, Mark Lillibridge, Xiaozho...
This paper provides four contributions to the study of optimization techniques for component-based distributed realtime and embedded (DRE) systems. First, we describe key challeng...
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
The paper systematically compares two feature extraction algorithms to mine product features commented on in customer reviews. The first approach [17] identifies candidate featu...