Sciweavers

242 search results - page 9 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
JSAC
2010
138views more  JSAC 2010»
14 years 10 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
ICDCS
2007
IEEE
15 years 6 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
96
Voted
AAAI
2008
15 years 2 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
IPTPS
2003
Springer
15 years 4 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
109
Voted
ICDCSW
2003
IEEE
15 years 5 months ago
An Adaptive Object Allocation and Replication Algorithm in Distributed Databases
In a Distributed Database System (DDBS), transactions on objects can be read requests or write requests in a random manner. The replication algorithm of objects critically affects...
Wujuan Lin, Bharadwaj Veeravalli