Sciweavers

229 search results - page 4 / 46
» Ergodic-Type Characterizations of Algorithmic Randomness
Sort
View
TMC
2012
11 years 9 months ago
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
Hyang-Won Lee, Eytan Modiano, Long Bao Le
SIGECOM
2008
ACM
131views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Truthful germs are contagious: a local to global characterization of truthfulness
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
Aaron Archer, Robert Kleinberg
WOSP
2005
ACM
14 years 20 days ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
SASO
2008
IEEE
14 years 1 months ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...
TPDS
2010
135views more  TPDS 2010»
13 years 5 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat