Sciweavers

239 search results - page 7 / 48
» Dynamic Response Time Optimization for SDF Graphs
Sort
View
CSCW
2012
ACM
12 years 3 months ago
Towards self-optimizing collaborative systems
Two important performance metrics in collaborative systems are local and remote response times. Previous analytical and simulation work has shown that these response times depend ...
Sasa Junuzovic, Prasun Dewan
ICC
2007
IEEE
130views Communications» more  ICC 2007»
14 years 1 months ago
A Distributed Scheme for Responsive Network Engineering
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
Johannes Göbel, Anthony E. Krzesinski, Dieter...
ECRTS
2006
IEEE
14 years 1 months ago
On a Theory of Media Processing Systems Behavior, with Applications
In this article we provide a model for the dynamic behavior of media processing chains of tasks communicating via bounded buffers. The aim is to find the overall behavior of a cha...
M. A. Weffers-Albu, Johan J. Lukkien, Elisabet F. ...
SIROCCO
2000
13 years 8 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul