Sciweavers

4759 search results - page 81 / 952
» Parallelizing the Phylogeny Problem
Sort
View
PARA
1995
Springer
13 years 11 months ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
APL
1993
ACM
14 years 21 hour ago
Identification of Parallelism in Neural Networks by Simulation with Language J.
: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is r...
Alexei N. Skurikhin, Alvin J. Surkan
EUROPAR
2004
Springer
14 years 1 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
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...
Edson Norberto Cáceres, Frank K. H. A. Dehn...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong
PC
2002
118views Management» more  PC 2002»
13 years 7 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin