Sciweavers

6542 search results - page 345 / 1309
» The tao of parallelism in algorithms
Sort
View
156
Voted
IPPS
2005
IEEE
16 years 13 days ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
Thomas Fischer, Peter Merz
174
Voted
JSSPP
2004
Springer
16 years 6 days ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
CAP
2010
15 years 1 months ago
Accuracy versus time: a case study with summation algorithms
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...
Philippe Langlois, Matthieu Martel, Laurent Th&eac...
172
Voted
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 10 months ago
Characterizing large text corpora using a maximum variation sampling genetic algorithm
An enormous amount of information available via the Internet exists. Much of this data is in the form of text-based documents. These documents cover a variety of topics that are v...
Robert M. Patton, Thomas E. Potok
SPDP
1991
IEEE
15 years 10 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari