Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow ti...
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
In this paper we present new concepts to resolve ECU (Electronic Control Unit) failures in FlexRay networks. Our approach extends the FlexRay bus schedule by redundant slots with m...
Kay Klobedanz, Gilles B. Defo, Henning Zabel, Wolf...
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...
Alexandre de Baynast, Omer Gurewitz, Edward W. Kni...