Results 1  10
of
1,293,526
Locally Complete Path Independent . . .
, 2000
"... The concept of path independence (PI) was first introduced by Arrow (1963) as a defense of his requirement that collective choices be rationalized by a weak ordering. Plott (1973) highlighted the dynamic aspects of PI implicit in Arrow’s initial discussion. Throughout these investigations two questi ..."
Abstract
 Add to MetaCart
questions, both initially raised by Plott, remained unanswered. What are the precise mathematical foundations for path independence? How can PI choice functions be constructed? We give complete answers to both these questions for finite domains and provide necessary conditions for infinite domains. We
Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks
 SIGCOMM'05
, 2005
"... Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks ..."
Abstract

Cited by 477 (9 self)
 Add to MetaCart
Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks
Complete path embedding in crossed cubes
 Information Sciences
, 2005
"... Abstract—The crossed cube is an important variant of the hypercube. The ndimensional crossed cube has only about half diameter, wide diameter, and fault diameter of those of the ndimensional hypercube. Embeddings of trees, cycles, shortest paths, and Hamiltonian paths in crossed cubes have been st ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract—The crossed cube is an important variant of the hypercube. The ndimensional crossed cube has only about half diameter, wide diameter, and fault diameter of those of the ndimensional hypercube. Embeddings of trees, cycles, shortest paths, and Hamiltonian paths in crossed cubes have been
Toward Complete Path Planning for Planar
 Proceedings of WAFR 2004
, 2005
"... The problem of planning a collisionfree motions of a planar 3Rmanipulator among point obstacles is studied using techniques from topology and homology. By completely characterizing the set of singular configurations (the points in configuration space corresponding to an intersection of the chain w ..."
Abstract
 Add to MetaCart
The problem of planning a collisionfree motions of a planar 3Rmanipulator among point obstacles is studied using techniques from topology and homology. By completely characterizing the set of singular configurations (the points in configuration space corresponding to an intersection of the chain
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1078 (5 self)
 Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
FROM X TO Y: THE ‘COMPLETE PATH’ CONSTRUCTION IN BASQUE
"... In Basque, there is recurrent tendency to express both the source and goal of movement for the description of translational motion even in cases where one of these elements is pleonastic. This construction called ‘Complete Path ’ (IbarretxeAntuñano 2002) shows up not only in physical description of ..."
Abstract
 Add to MetaCart
In Basque, there is recurrent tendency to express both the source and goal of movement for the description of translational motion even in cases where one of these elements is pleonastic. This construction called ‘Complete Path ’ (IbarretxeAntuñano 2002) shows up not only in physical description
Routing in a delay tolerant network
 Proceedings of ACM Sigcomm
, 2004
"... We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract

Cited by 612 (8 self)
 Add to MetaCart
that no contemporaneous endtoend path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing endtoend path. We propose a framework for evaluating routing algorithms in such environments. We then develop several
Practical network support for IP traceback
, 2000
"... This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denialofservice attacks and by the difficulty in tracing packets with incorrect, or “spoofed”, source ad ..."
Abstract

Cited by 666 (14 self)
 Add to MetaCart
addresses. In this paper we describe a general purpose traceback mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic without requiring interactive operational support from Internet Service Providers (ISPs
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Results 1  10
of
1,293,526