Results 1  10
of
7,303
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
, 2001
"... 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 503 (10 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 Algebras and Rational Modules
"... Abstract We study rational modules over complete path and monomial algebras, and the problem of when rational modules over the dual C * of a coalgebra C are closed under extensions, equivalently, when is the functor Rat a torsion functor. We show that coreflexivity, closure under extensions of fini ..."
Abstract
 Add to MetaCart
Abstract We study rational modules over complete path and monomial algebras, and the problem of when rational modules over the dual C * of a coalgebra C are closed under extensions, equivalently, when is the functor Rat a torsion functor. We show that coreflexivity, closure under extensions
Complete path embedding in crossed cubes
 INFORMATION SCIENCES
, 2005
"... 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 studied in ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
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 studied
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
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
, 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 621 (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 678 (13 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
DART: Directed automated random testing
 In Programming Language Design and Implementation (PLDI
, 2005
"... We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static sourcecode parsing; (2) automatic generation of a test driver for this interface that performs ..."
Abstract

Cited by 843 (42 self)
 Add to MetaCart
that performs random testing to simulate the most general environment the program can operate in; and (3) dynamic analysis of how the program behaves under random testing and automatic generation of new test inputs to direct systematically the execution along alternative program paths. Together, these three
The Implementation of the Cilk5 Multithreaded Language
, 1998
"... The fifth release of the multithreaded language Cilk uses a provably good "workstealing " scheduling algorithm similar to the rst system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided ..."
Abstract

Cited by 489 (28 self)
 Add to MetaCart
The fifth release of the multithreaded language Cilk uses a provably good "workstealing " scheduling algorithm similar to the rst system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided
Results 1  10
of
7,303