391 search results - page 8 / 79 » Structural and algorithmic issues of dynamic protocol update |
STOC
2010
ACM
14 years 6 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Minimal change is a fundamental principle for modeling system dynamics. In this paper, we study the issue of minimal change for Computational Tree Logic (CTL) model update. We firs...
INFOCOM
1993
IEEE
13 years 11 months ago
1993
IEEE
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...
RT
1997
Springer
13 years 11 months ago
1997
Springer
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...