Sciweavers

108 search results - page 12 / 22
» Spreading of Messages in Random Graphs
Sort
View
SPAA
2009
ACM
14 years 2 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
PODC
2010
ACM
13 years 5 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
AISS
2010
161views more  AISS 2010»
13 years 4 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
COCOA
2009
Springer
13 years 11 months ago
Positive Influence Dominating Set in Online Social Networks
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
Feng Wang 0002, Erika Camacho, Kuai Xu
INFOCOM
2009
IEEE
14 years 2 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar