Sciweavers

62 search results - page 5 / 13
» Revisiting Genetic Algorithms for the FPGA Placement Problem
Sort
View
CEC
2007
IEEE
14 years 1 months ago
A novel genetic algorithm for the layout optimization problem
— In this paper we present a new algorithm for the Layout Optimization Problem: this concerns the placement of circular, weighted objects inside a circular container, the two obj...
Yichun Xu, Renbin Xiao, Martyn Amos
IWINAC
2005
Springer
14 years 29 days ago
GA-Selection Revisited from an ES-Driven Point of View
Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution S...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
13 years 11 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
ICCAD
1995
IEEE
106views Hardware» more  ICCAD 1995»
13 years 11 months ago
Re-engineering of timing constrained placements for regular architectures
In a typical design ow, the design may be altered slightly several times after the initial design cycle according to minor changes in the design speci cation either as a result o...
Anmol Mathur, K. C. Chen, C. L. Liu
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
13 years 11 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood