Sciweavers

25167 search results - page 44 / 5034
» Parallel and Distributed Algorithms
Sort
View
IPPS
1997
IEEE
15 years 1 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
94
Voted
PPL
2002
83views more  PPL 2002»
14 years 9 months ago
Trading Replication for Communication in Parallel Distributed-Memory Dense Solvers
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...
Dror Irony, Sivan Toledo
79
Voted
IPPS
1998
IEEE
15 years 1 months ago
A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
Pierpaolo Baglietto, Massimo Maresca, Mauro Miglia...
ISHPC
2003
Springer
15 years 2 months ago
Distribution-Insensitive Parallel External Sorting on PC Clusters
There have been many parallel external sorting algorithms reported such as NOW-Sort, SPsort, and hill sort, etc. They are for sorting large-scale data stored in the disk, but they ...
Minsoo Jeon, Dongseung Kim
PPSN
1994
Springer
15 years 1 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
Günter Rudolph