Sciweavers

4045 search results - page 358 / 809
» Special Section on Parallel Distributed Computing and Networ...
Sort
View
132
Voted
IPPS
2007
IEEE
15 years 10 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
OPODIS
2010
15 years 1 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
ICDCS
2006
IEEE
15 years 10 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IPPS
2006
IEEE
15 years 10 months ago
Analysis of a reconfigurable network processor
In this paper an analysis of a dynamically reconfigurable processor is presented. The network processor incorporates a processor and a number of coprocessors that can be connected...
Christopher Kachris, Stamatis Vassiliadis
129
Voted
TCS
2008
15 years 3 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun