Sciweavers

9 search results - page 1 / 2
» An effective two-stage simulated annealing algorithm for the...
Sort
View
COR
2008
118views more  COR 2008»
13 years 4 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
AE
2005
Springer
13 years 10 months ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
VLSID
1996
IEEE
119views VLSI» more  VLSID 1996»
13 years 9 months ago
Parallel simulated annealing strategies for VLSI cell placement
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...
John A. Chandy, Prithviraj Banerjee
ASPDAC
2006
ACM
146views Hardware» more  ASPDAC 2006»
13 years 10 months ago
A fixed-die floorplanning algorithm using an analytical approach
— Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the t...
Yong Zhan, Yan Feng, Sachin S. Sapatnekar
ICDM
2008
IEEE
175views Data Mining» more  ICDM 2008»
13 years 11 months ago
Overlapping Matrix Pattern Visualization: A Hypergraph Approach
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dr...