Sciweavers

54 search results - page 7 / 11
» Modern floorplanning based on fast simulated annealing
Sort
View
AE
2005
Springer
14 years 17 days 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-...
FPL
2005
Springer
127views Hardware» more  FPL 2005»
14 years 16 days ago
Fast FPGA Placement using Space-filling Curve
In this paper, we propose a placement method for islandstyle FPGAs, based on recursive bi-partitioning followed by application of space-filling curves. Experimental results of ou...
Pritha Banerjee, Subhasis Bhattacharjee, Susmita S...
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
13 years 11 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
WSC
2000
13 years 8 months ago
Simulation based design for a shipyard manufacturing process
Discrete event simulation can be used for virtual prototyping of new manufacturing facilities. Models built for this purpose must be easy to use, flexible, and provide a realistic...
Deborah J. Medeiros, Mark T. Traband, April Tribbl...
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
13 years 11 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian