Sciweavers

5966 search results - page 572 / 1194
» Distributed Caching Algorithms for Content Distribution Netw...
Sort
View
PODC
2012
ACM
13 years 8 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
IJAR
2007
55views more  IJAR 2007»
15 years 6 months ago
Theoretical analysis and practical insights on importance sampling in Bayesian networks
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
Changhe Yuan, Marek J. Druzdzel
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 10 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang
184
Voted
EUROPAR
2006
Springer
15 years 10 months ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
ICDCSW
2002
IEEE
15 years 11 months ago
Toward a Peer-to-Peer Shared Virtual Reality
— This paper envisions a shared virtual reality system that could handle millions of users and objets. The SOLIPSIS system does not rely on servers and is based on a network of p...
Joaquín Keller, Gwendal Simon