Sciweavers

7133 search results - page 208 / 1427
» Communication algorithms with advice
Sort
View
ISCC
2000
IEEE
15 years 8 months ago
An Efficient and Flexible Late Join Algorithm for Interactive Shared Whiteboards
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
Werner Geyer, Jürgen Vogel, Martin Mauve
CDC
2008
IEEE
192views Control Systems» more  CDC 2008»
15 years 7 months ago
Distributed coordination algorithms for multiple fractional-order systems
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
Yongcan Cao, Yan Li, Wei Ren, Yangquan Chen
152
Voted
JGAA
2006
127views more  JGAA 2006»
15 years 5 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
ICC
2007
IEEE
145views Communications» more  ICC 2007»
15 years 11 months ago
Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks
— A crucial problem in ad hoc networks is finding an efficient and correct route between a source and a destination; however for many networks, a more important problem is prov...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
178
Voted
ICC
2007
IEEE
145views Communications» more  ICC 2007»
15 years 11 months ago
Lowering Error Floor of LDPC Codes Using a Joint Row-Column Decoding Algorithm
Low-density parity-check codes using the beliefpropagation decoding algorithm tend to exhibit a high error floor in the bit error rate curves, when some problematic graphical stru...
Zhiyong He, Sébastien Roy 0002, Paul Fortie...