Solving the N-Queens problem with a binary Hopfield-type network
Solving the N-Queens problem with a binary Hopfield-type network
复制标题
用二元 Hopfield 型网络解决 N 皇后问题
DOI：
10.1007/bf00201419
复制
发表时间：
1995
影响因子：
1.9
通讯作者：
J. Mańdziuk
中科院分区：
文献类型：
--
作者：
J. Mańdziuk
将离散Hopfield型神经网络应用于求解NP难优化问题--N皇后问题(NQP)。应用的网络是二进制的，每个时刻每个神经元的电势要么等于0，要么等于1。该网络既可以在异步模式下实现，也可以在具有并行运行的处理器的同步模式下实现。在两种情况下，收敛速度都达到了100%，平均计算复杂度的实验估计是多项式的。在计算机仿真结果和理论分析的基础上，确定了合适的网络参数。对网络的行为进行了解释。
The application of a discrete Hopfield-type neural network to solving the NP-Hard optimization problem — the N-Queens Problem (NQP) — is presented. The applied network is binary, and at every moment each neuron potential is equal to either 0 or 1. The network can be implemented in the asynchronous mode as well as in the synchronous one withnparallel running processors. In both cases the convergence rate is up to 100%, and the experimental estimate of the average computational complexity is polynomial. Based on the computer simulation results and the theoretical analysis, the proper network parameters are established. The behaviour of the network is explained.