128 search results - page 2 / 26 » Parallel Simulated Annealing Algorithm for Graph Coloring Pr... |
ADMA
2005
Springer
2005
Springer
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
13 years 10 months ago
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...
PPSN
2004
Springer
13 years 10 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
CEC
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...