Sciweavers

6105 search results - page 20 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
SWAT
2010
Springer
207views Algorithms» more  SWAT 2010»
15 years 27 days ago
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
David P. Bunde, Michael H. Goldwasser
120
Voted
ISAAC
2010
Springer
216views Algorithms» more  ISAAC 2010»
15 years 13 days ago
Fractal Parallelism: Solving SAT in Bounded Space and Time
Denys Duchier, Jérôme Durand-Lose, Ma...
116
Voted
ICPP
2009
IEEE
15 years 8 days ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
136
Voted
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
15 years 8 months ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora