Sciweavers

7941 search results - page 1300 / 1589
» Network Analysis of Repositories
Sort
View
COMCOM
2006
75views more  COMCOM 2006»
15 years 6 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
IJMMS
2008
99views more  IJMMS 2008»
15 years 6 months ago
Storied spaces: Cultural accounts of mobility, technology, and environmental knowing
When we think of mobility in technical terms, we think of topics such as bandwidth, resource management, location, and wireless networks. When we think of mobility in social or cu...
Johanna Brewer, Paul Dourish
JAL
2006
89views more  JAL 2006»
15 years 6 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler
JNW
2006
145views more  JNW 2006»
15 years 6 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
SIAMAM
2008
97views more  SIAMAM 2008»
15 years 6 months ago
Convergence of Dual Algorithm with Arbitrary Communication Delays
We study the issue of convergence of user rates and resource prices under a family of rate control schemes called dual algorithms with arbitrary communication delays. We first con...
Richard J. La, Priya Ranjan
« Prev « First page 1300 / 1589 Last » Next »