Sciweavers

54 search results - page 5 / 11
» Modern floorplanning based on fast simulated annealing
Sort
View
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
13 years 11 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
CEC
2007
IEEE
14 years 1 months ago
Improving generalization capability of neural networks based on simulated annealing
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...
Yeejin Lee, Jong-Seok Lee, Sun-Young Lee, Cheol Ho...
IPPS
2000
IEEE
13 years 11 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
EPIA
2007
Springer
14 years 1 months ago
Evaluating Simulated Annealing Algorithms in the Optimization of Bacterial Strains
Abstract. In this work, a Simulated Annealing (SA) algorithm is proposed for a Metabolic Engineering task: the optimization of the set of gene deletions to apply to a microbial str...
Miguel Rocha, Rui Mendes, Paulo Maia, José ...
AAAI
2008
13 years 9 months ago
From Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
Zhiwu Lu, Yuxin Peng, Jianguo Xiao