Sciweavers

1095 search results - page 46 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
PODC
2012
ACM
13 years 4 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
ISCI
1998
193views more  ISCI 1998»
15 years 2 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza
110
Voted
MSS
2003
IEEE
113views Hardware» more  MSS 2003»
15 years 7 months ago
Design and Implementation of Multiple Addresses Parallel Transmission Architecture for Storage Area Network
In this paper, we present a parallel transmission architecture for SAN. By using two schedulers on the destination and source addresses of packets, the load of multiple data flows...
Bin Meng, Patrick B. T. Khoo, T. C. Chong
107
Voted
EUROPAR
2003
Springer
15 years 7 months ago
Exploring the Catallactic Coordination Approach for Peer-to-Peer Systems
Efficient discovery and resource allocation is one of the challenges of current Peer-to-Peer systems. In centralized approaches, the user requests can be matched to the fastest, ch...
Oscar Ardaiz, Pau Artigas, Torsten Eymann, Felix F...
107
Voted
ICC
2007
IEEE
111views Communications» more  ICC 2007»
15 years 8 months ago
Computationally Efficient Optimal Discrete Bit Allocation for Medium and High Target Bit Rate DMT Transmissions
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
Li-ping Zhu, Xiaofeng Zhong, Yan Yao, Shi-wei Dong...