13 search results - page 1 / 3 » Improving bipartite graphs using multi-strategy simulated an... |
ACMSE
1999
ACM
13 years 9 months ago
1999
ACM
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...
DDECS
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
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 Î...