Sciweavers

4759 search results - page 103 / 952
» Parallelizing the Phylogeny Problem
Sort
View
ICS
1993
Tsinghua U.
14 years 2 days ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
FOCS
1990
IEEE
14 years 1 days ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
ACMSE
2008
ACM
13 years 10 months ago
Parallel processing flow models on desktop hardware
Numerical solution of any large, three-dimensional fluid flow problem is a computationally intensive task that typically requires supercomputer solution to achieve reasonable exec...
Robert Geist, Zachary Jones, Jay E. Steele
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 8 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
GECCO
2005
Springer
118views Optimization» more  GECCO 2005»
14 years 1 months ago
Comparative evaluation of parallelization strategies for evolutionary and stochastic heuristics
In this paper we present an evaluation of selected parallel strategies for Simulated Annealing and Simulated Evolution, identifying the impact of various issues on the effectivene...
Sadiq M. Sait, Syed Sanaullah, Ali Mustafa Zaidi, ...