Sciweavers

1095 search results - page 95 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
111
Voted
CONCUR
2006
Springer
15 years 6 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
147
Voted
HPDC
2008
IEEE
15 years 2 months ago
Collaborative ranking of grid-enabled workflow service providers
Service Oriented Architecture (SOA) and Grid computing are very hot research topics, nowadays. While Grid computing is aimed at sharing dynamically heterogeneous resources, SOAs i...
Domenico Laforenza, Franco Maria Nardini, Fabrizio...
104
Voted
ICDCS
2008
IEEE
15 years 9 months ago
Hotness-Aware Sensor Networks
In a realistic sensor network, in particular with a nonuniform deployment, sensor nodes inevitably have varying workloads. This causes a natural problem that some sensor nodes are...
Dong Li, Yanmin Zhu, Li Cui, Lionel M. Ni
115
Voted
HIPC
2007
Springer
15 years 8 months ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...
120
Voted
ICPP
2006
IEEE
15 years 8 months ago
Social Welfare Based Routing in Ad hoc Networks
— Due to resource scarcity, a paramount concern in ad hoc networks is to utilize the limited resources efficiently. The self-organized nature of ad hoc networks makes the social...
Mingming Lu, Jie Wu