62 search results - page 2 / 13 » Revisiting Genetic Algorithms for the FPGA Placement Problem |
136
Voted
FPL
2000
Springer
15 years 9 months ago
2000
Springer
State-of-the-art FPGAs possess I/O resources that can be configured to support a wide variety of I/O standards [1]. In such devices, the I/O resources are grouped into banks. One o...
138
Voted
EOR
2007
15 years 5 months ago
2007
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
150
Voted
DAC
1997
ACM
15 years 10 months ago
1997
ACM
The “quadratic placement” methodology is rooted in [6] [14] [16] and is reputedly used in many commercial and in-house tools for placement of standard-cell and gate-array desi...
242
Voted
FPGA
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
158
Voted
ERSA
2010
15 years 3 months ago
2010
A major focus within the Integrated Chip (IC) industry is reducing power consumption of devices. In this paper, we explore the idea of persistent CAD algorithms that constantly imp...