期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
The Complexity of Recognition in the Single-Layered PLN Network with Feedback Connections 被引量:1
1
作者 张钹 张铃 《Journal of Computer Science & Technology》 SCIE EI CSCD 1993年第4期317-321,共5页
Regarding a single-layered PLN network with feedback connections as an associative memory network,the complexity of recognition is discussed.We have the main result:if the size of the network N is m,then the complexit... Regarding a single-layered PLN network with feedback connections as an associative memory network,the complexity of recognition is discussed.We have the main result:if the size of the network N is m,then the complexity of recognition is an exponential function of m.The necessary condition under which the complexity of recognition is polynomial is given. 展开更多
关键词 PLN network stable state associative memory network Markov chain transition matrix complexity of recognition
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部