206 search results - page 10 / 42 » Three Hoppy path problems and ternary paths |
115
Voted
ICNP
2002
IEEE
15 years 8 months ago
2002
IEEE
The TCP transport layer protocol is designed for connections that traverse a single path between the sender and receiver. However, there are several environments in which multiple...
130
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss events) is critical to ensuring the effective operation of network infrastructu...
169
Voted
COR
2008
15 years 3 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
134
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
140
Voted
JDA
2006
15 years 3 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...