Sciweavers

242 search results - page 16 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
AC
2003
Springer
15 years 5 months ago
The Importance of Aggregation
Abstract—The dynamics of the survival of recruiting fish are analyzed as evolving random processes of aggregation and mortality. The analyses draw on recent advances in the phys...
Robbert van Renesse
INFOCOM
2011
IEEE
14 years 3 months ago
Consolidating virtual machines with dynamic bandwidth demand in data centers
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
Meng Wang, Xiaoqiao Meng, Li Zhang 0002
TC
2008
14 years 11 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
ICML
2004
IEEE
16 years 15 days ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
CP
2005
Springer
15 years 5 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels