128 search results - page 6 / 26 » Parallel Simulated Annealing Algorithm for Graph Coloring Pr... |
ICIP
1995
IEEE
14 years 9 months ago
1995
IEEE
In this paper, we address the problem of color image restoration. Here, we model the image as a Markov Random Field (MRF) and propose a restoration algorithm in a multiresolution ...
IJAIT
2007
13 years 7 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
PARA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
ICS
1993
Tsinghua U.
13 years 11 months ago
1993
Tsinghua U.
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 ...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...