1578 search results - page 140 / 316 » Direct Routing: Algorithms and Complexity |
GEOINFORMATICA
2006
13 years 9 months ago
2006
Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P app...
BIBM
2010
IEEE
13 years 6 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
ANSS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper Hidden Markov Model algorithms are considered as a method for computing conditional properties of continuous-time stochastic simulation models. The goal is to develo...
SIGCOMM
2005
ACM
14 years 2 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...