832 search results - page 48 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
EUROPAR
2004
Springer
15 years 3 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
SIAMSC
2010
14 years 8 months ago
2010
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
VECPAR
2000
Springer
15 years 1 months ago
2000
Springer
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...
123
click to vote
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...