Sciweavers

9888 search results - page 196 / 1978
» compute 2009
Sort
View
HPCC
2009
Springer
15 years 4 months ago
Reliability Optimization of Reconfigurable Computing-Based Fault-Tolerant System
Domain-partition (DP) model is a general model for reliability maximization problem under given redundancy. In this paper, an improved DP model is used to formulate a reconfigurati...
Mi Zhou, Lihong Shang, Yu Hu
ICPP
2009
IEEE
15 years 4 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
ICC
2009
IEEE
127views Communications» more  ICC 2009»
16 years 1 months ago
A Study on Cross-Layer Multi-Constraint Path Computation for IP-Over-Optical Networks
— A powerful path computation element is a must for the next-generation IP-over-Optical networks to support ondemand service provisioning crossing layers. The main purpose of pat...
Xi Yang, Tom Lehman, Kenichi Ogaki, Tomohiro Otani
CCA
2009
Springer
16 years 26 days ago
Computability of Homology for Compact Absolute Neighbourhood Retracts
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...
Pieter Collins
CCA
2009
Springer
16 years 26 days ago
Computability of Probability Distributions and Distribution Functions
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi