6105 search results - page 332 / 1221 » A Parallel Algorithm for Bound-Smoothing |
151
click to vote
IPPS
2005
IEEE
16 years 10 days ago
2005
IEEE
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...
172
click to vote
JSSPP
2004
Springer
16 years 3 days ago
2004
Springer
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...
168
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
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...
144
click to vote
SPDP
1991
IEEE
15 years 10 months ago
1991
IEEE
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...
179
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...