Sciweavers

1134 search results - page 156 / 227
» Distributed Proving in Access-Control Systems
Sort
View
NCA
2007
IEEE
15 years 9 months ago
Implementing Atomic Data through Indirect Learning in Dynamic Networks
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
Kishori M. Konwar, Peter M. Musial, Nicolas C. Nic...
SPAA
1994
ACM
15 years 7 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
ICDCS
1995
IEEE
15 years 6 months ago
Implementing Sequentially Consistent Shared Objects Using Broadcast and Point-to-Point Communication
A distributed algorithm that implements a sequentially consistent collection of shared read/update objects using a combination of broadcast and point-to-point communication is pre...
Alan Fekete, M. Frans Kaashoek, Nancy A. Lynch
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 3 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
INFOCOM
2012
IEEE
13 years 5 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov