Sciweavers

1388 search results - page 222 / 278
» Approximability of Robust Network Design
Sort
View
USENIX
2001
13 years 11 months ago
Scalable Linux Scheduling
For most of its existence, Linux has been used primarily as a personal desktop operating system. Yet, in recent times, its use as a cost-efficient alternative to commercial operat...
Stephen Molloy, Peter Honeyman
CCR
2004
113views more  CCR 2004»
13 years 9 months ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim
IJON
2006
109views more  IJON 2006»
13 years 10 months ago
Integrating the improved CBP model with kernel SOM
In this paper, we first design a more generalized network model, Improved CBP, based on the same structure as Circular BackPropagation (CBP) proposed by Ridella et al. The novelty ...
Qun Dai, Songcan Chen
FOCS
2002
IEEE
14 years 2 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
SASO
2008
IEEE
14 years 4 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...