Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Neural Networks for Optimization and Signal Processing
Neural Networks for Optimization and Signal Processing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A min-cut placement algorithm for general cell assemblies based on a graph representation
DAC '79 Proceedings of the 16th Design Automation Conference
A continuous Hopfield network equilibrium points algorithm
Computers and Operations Research
Implementation feasibility of convex recursive deletion regions using multi-layer perceptrons
WSEAS Transactions on Computers
Constraint satisfaction problems solved by semidefinite relaxations
WSEAS Transactions on Computers
Robot mapping and map optimization using genetic algorithms and artificial neural networks
WSEAS Transactions on Computers
Better learning of supervised neural networks based on functional graph: an experimental approach
WSEAS Transactions on Computers
Neural architectures optimization and genetic algorithms
WSEAS Transactions on Computers
| Hi-index | 0.00 |
The Placement of the Electronic Circuits Problem (PECP) is considered as one of the most difficult optimization problems. The PECP has been expressed as a Quadratic Knapsack Problem (QKP) with linear constraints. The goals of this work are to solve the Placement of the Electronic Circuits Problem (PECP) using the Continuous Hopfield Networks (CHN) and to illustrate, from a computational point of view, the advantages of CHN by its implement in the PECP. The resolution of the QKP via the CHN is based on some energy or Lyapunov function, which diminishes as the system develops until a local minimum value is obtained. The Decomposition approach was used to solve the PECP. This method suffers from problems of feasibility of solutions and long training time. Unlike the decomposition approach, the CHN is much faster and all the solutions are feasible. Finally, some computational experiments solving the PECP are included.