Results 1  10
of
262,544
Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks
 In Proc. Int. IEEE Conf. on Comm., 2001
"... Abstract – In recent years, routing has been the most focused area in ad hoc networks research. Ondemand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed ondemand routing protocols however ..."
Abstract

Cited by 435 (4 self)
 Add to MetaCart
linkstate or distance vector algorithms which are not wellsuited for ad hoc networks. We propose an ondemand routing scheme called Split Multipath Routing (SMR) that establishes and utilizes multiple routes of maximally disjoint paths. Providing multiple routes helps minimizing route recovery
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
, 2008
"... We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fashion, where every request is a path in the tree. The online algorithm may accept a request only if it does not share a ver ..."
Abstract
 Add to MetaCart
on the line. In the current work we present a randomized online algorithm with preemption that has constant competitive ratio on any tree. Our results carry over to the related problem of maximizing the number of accepted paths subject to a capacity constraint on vertices (in the disjoint path problem
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
 Machine Learning
, 1998
"... . This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract

Cited by 483 (43 self)
 Add to MetaCart
data, alog with the most likely path taken by the robot. Experimental results in cyclic environments of size up to 80 by 25 meter illustrate the appropriateness of the approach. Keywords: Bayes rule, expectation maximization, mobile robots, navigation, localization, mapping, maximum likelihood
Ondemand Multipath Distance Vector Routing in Ad Hoc Networks
 in Proceedings of IEEE International Conference on Network Protocols (ICNP
, 2001
"... We develop an ondemand, multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a wellstudied single path routing protocol known as Ad hoc Ondemand Distance Vector (AODV). The resulting protocol is referred to as Ad hoc Ondemand Multipath Di ..."
Abstract

Cited by 360 (3 self)
 Add to MetaCart
Distance Vector (AOMDV). The protocol computes multiple loopfree and linkdisjoint paths. Loopfreedom is guaranteed by using a notion of "advertised hopcount." Linkdisjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV
Skipnet: A scalable overlay network with practical locality properties
, 2003
"... Abstract: Scalable overlay networks such as Chord, Pastry, and Tapestry have recently emerged as a flexible infrastructure for building large peertopeer systems. In practice, two disadvantages of such systems are that it is difficult to control where data is stored and difficult to guarantee that ..."
Abstract

Cited by 359 (5 self)
 Add to MetaCart
that routing paths remain within an administrative domain. SkipNet is a scalable overlay network that provides controlled data placement and routing locality guarantees by organizing data primarily by lexicographic key ordering. SkipNet also allows for both finegrained and coarsegrained control over data
Prices and unit labor costs: A new test of price stickiness
, 1999
"... This paper investigates the predictions of a simple optimizing model of nominal price rigidity for the aggregate price level and the dynamics of inflation. I compare the model’s predictions with those of a perfectly competitive, flexible price ‘benchmark’ model (corresponding to the model of pricing ..."
Abstract

Cited by 356 (11 self)
 Add to MetaCart
productivity, and output, I determine the implied path of prices predicted by the model. Because prices are not a stationary series, I present my results in terms of the predicted path of the price/unit labor cost ratio, where the parameters characterizing such paths are chosen to maximize the fit
Epidemic routing for partiallyconnected ad hoc networks
, 2000
"... Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any preexisting network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination ..."
Abstract

Cited by 358 (0 self)
 Add to MetaCart
Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any preexisting network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source
Approximation Algorithms for Disjoint Paths Problems
, 1996
"... The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems for w ..."
Abstract

Cited by 166 (0 self)
 Add to MetaCart
The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems
Vertex Disjoint Paths for Dispatching in Railways
, 2010
"... We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization, and routinginrounds problem. Although all considered variants are NPhard in planar graphs, restrictions on the locat ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization, and routinginrounds problem. Although all considered variants are NPhard in planar graphs, restrictions
Results 1  10
of
262,544