摘要
已知一个有向图,求解两点间的最短路径的决策变量满足基尔霍夫约束关系。决策变量对应神经网络的状态,可以分为独立的和非独立的两部分。非独立变量的解可由独立变量的解线性组合而得到,给出了求解独立变量神经网络方程。
In a directed graph, the decision variables of the shortest path computation must be determined by a constraint that is called Kirchoff's constraint. These decision variables corresponding to the states of neural network can be classified as independent and dependent. The dependent variables can be solved by the linear combination of values of independent variables, and the formulation for neural network based on independent variables is given.
出处
《电路与系统学报》
CSCD
北大核心
2005年第4期61-65,共5页
Journal of Circuits and Systems
基金
国家863基金项目(2001AA14033)
关键词
最短路径
神经网络
基尔霍夫约束
独立变量
shortest path
neural network
Kirchoff's constraint
independent variables