Sciweavers

5183 search results - page 88 / 1037
» The Complexity of Distributions
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 4 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
AIPS
2009
15 years 5 months ago
Exploiting Coordination Locales in Distributed POMDPs via Social Model Shaping
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-wo...
Pradeep Varakantham, Jun-young Kwak, Matthew E. Ta...
IPTPS
2005
Springer
15 years 10 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang
IANDC
2007
84views more  IANDC 2007»
15 years 4 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 7 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang