Sciweavers

2808 search results - page 405 / 562
» Routing betweenness centrality
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 5 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
ENTCS
2008
64views more  ENTCS 2008»
15 years 5 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
FSS
2008
105views more  FSS 2008»
15 years 5 months ago
The self-dual core and the anti-self-dual remainder of an aggregation operator
In most decisional models based on pairwise comparison between alternatives, the reciprocity of the individual preference representations expresses a natural assumption of rationa...
José Luis García-Lapresta, Ricardo A...
BMCBI
2006
108views more  BMCBI 2006»
15 years 5 months ago
NOXclass: prediction of protein-protein interaction types
Background: Structural models determined by X-ray crystallography play a central role in understanding protein-protein interactions at the molecular level. Interpretation of these...
Hongbo Zhu, Francisco S. Domingues, Ingolf Sommer,...
COMCOM
2006
213views more  COMCOM 2006»
15 years 5 months ago
Energy efficient information dissemination protocols by negotiation for wireless sensor networks
In this paper we consider a distributed and efficient information dissemination and retrieval system for wireless sensor networks. In such a system each sensor node operates auton...
Dandan Liu, Xiaodong Hu, Xiaohua Jia