Sciweavers

12301 search results - page 1699 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
PODC
2004
ACM
16 years 26 days ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
CCR
2004
157views more  CCR 2004»
15 years 7 months ago
Designing BGP-based outbound traffic engineering techniques for stub ASes
Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manu...
Steve Uhlig, Olivier Bonaventure
SOSP
2003
ACM
16 years 4 months ago
SplitStream: high-bandwidth multicast in cooperative environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highlyava...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...
DEBS
2008
ACM
15 years 9 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
CDC
2008
IEEE
16 years 1 months ago
Shannon meets Bellman: Feature based Markovian models for detection and optimization
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...
Sean P. Meyn, George Mathew
« Prev « First page 1699 / 2461 Last » Next »