Sciweavers

23413 search results - page 4392 / 4683
» or 2005
Sort
View
194
Voted
SPAA
2005
ACM
16 years 1 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
SPAA
2005
ACM
16 years 1 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
SPAA
2005
ACM
16 years 1 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 1 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
STORAGESS
2005
ACM
16 years 1 months ago
Secure capabilities for a petabyte-scale object-based distributed file system
Recently, the Network-Attached Secure Disk (NASD) model has become a more widely used technique for constructing large-scale storage systems. However, the security system proposed...
Christopher Olson, Ethan L. Miller
« Prev « First page 4392 / 4683 Last » Next »