Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit
M Hulin�- International Conference on Parallel Problem Solving�…, 1990 - Springer
M Hulin
International Conference on Parallel Problem Solving from Nature, 1990•Springer… It is used to optimize circuit partitionings. In this section the coding of the circuit and the
used genetic operators are explained. … Create Nml n individuals I: The number of groups
is fixed and proportional to m = x/n. Each complex component is assigned to a group at
random (chromosome 1, I.C1). …
used genetic operators are explained. … Create Nml n individuals I: The number of groups
is fixed and proportional to m = x/n. Each complex component is assigned to a group at
random (chromosome 1, I.C1). …
4. Results To test the genetic algorithms for their quality and their efficiency four test circuits have been developped:
1: register transfer description, regular structure (273 components, 547 nets)
Springer
Showing the best result for this search. See all results