Sciweavers

242 search results - page 36 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
AI
2008
Springer
14 years 11 months ago
Managing parallel inquiries in agents' two-sided search
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...
David Sarne, Sarit Kraus
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 3 months ago
Gossip PCA
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
Satish Babu Korada, Andrea Montanari, Sewoong Oh
SPAA
2003
ACM
15 years 4 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
110
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management
Abstract—In this paper, we present the implementation issues of a virtual backbone that supports the operations of the Uniform Quorum System (UQS) and the Randomized Database Gro...
Ben Liang, Zygmunt J. Haas
83
Voted
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
15 years 3 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum