Sciweavers

1612 search results - page 33 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 4 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
SPAA
2005
ACM
14 years 29 days ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
IPPS
2000
IEEE
13 years 11 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco
INFOCOM
2005
IEEE
14 years 1 months ago
Non-uniform random membership management in peer-to-peer networks
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
Ming Zhong, Kai Shen, Joel I. Seiferas
EUSFLAT
2003
110views Fuzzy Logic» more  EUSFLAT 2003»
13 years 8 months ago
Fuzzy-neuro risk assessment of distributed real-time systems through formal and object-oriented systems modelling
The purpose of this paper is to advocate and encourage the application of fuzzy-neuro algorithms in the risk assessment of Distributed Real-Time (DRT) systems, where object-orient...
Atoosa P.-J. Thunem