In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted f...
Most previous research done in probabilistic schedulability analysis assumes a known distribution of execution times for each task of a real-time application. This is however not ...
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
The tracking performance of adaptive filters is crucially important in practical applications involving time-varying systems. We present an analysis of the tracking performance f...
Pradeep Loganathan, Emanuel A. P. Habets, Patrick ...
Abstract— With the increasing demand for low-latency applications in the Internet, the slow convergence of the existing routing protocols is a growing concern. A number of IP fas...