391 search results - page 14 / 79 » Structural and algorithmic issues of dynamic protocol update |
113
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynam...
137
Voted
ICCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
253
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
179
Voted
AINA
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
156
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...