1095 search results - page 43 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
116
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...
124
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
125
click to vote
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
15 years 5 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
112
click to vote
PPL
2007
15 years 1 months ago
2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
117
click to vote
ICPPW
2005
IEEE
15 years 8 months ago
2005
IEEE
— In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central ad...