128 search results - page 4 / 26 » Parallel Simulated Annealing Algorithm for Graph Coloring Pr... |
127
click to vote
CPHYSICS
2006
15 years 2 months ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
120
click to vote
VLSID
1996
IEEE
15 years 6 months ago
1996
IEEE
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been un...
EOR
2008
15 years 2 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
120
click to vote
AAAI
2007
15 years 4 months ago
2007
This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based...
106
click to vote
HPCC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...