Sciweavers

376 search results - page 54 / 76
» Self-Stabilizing Graph Protocols
Sort
View
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
13 years 10 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
PSTV
1993
123views Hardware» more  PSTV 1993»
13 years 10 months ago
On the Verification of Temporal Properties
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
Patrice Godefroid, Gerard J. Holzmann
CSJM
2008
112views more  CSJM 2008»
13 years 9 months ago
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
Artiom Alhazov, Yurii Rogozhin
FAST
2009
13 years 6 months ago
HYDRAstor: A Scalable Secondary Storage
HYDRAstor is a scalable, secondary storage solution aimed at the enterprise market. The system consists of a back-end architectured as a grid of storage nodes built around a distr...
Cezary Dubnicki, Leszek Gryz, Lukasz Heldt, Michal...
BMCBI
2011
13 years 3 months ago
A lightweight, flow-based toolkit for parallel and distributed bioinformatics pipelines
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...
Marcin Cieslik, Cameron Mura