本人编写的incremental 随机神经元网络算法
本人编写的incremental 随机神经元网络算法,该算法最大的特点是可以保证approximation特性,而且速度快效果不错,可以作为学术上的比较和分析。目前只适合benchmark的regression问题。 具体效果可参考 G.-B. Huang, L. Chen and C.-K. ...
本人编写的incremental 随机神经元网络算法,该算法最大的特点是可以保证approximation特性,而且速度快效果不错,可以作为学术上的比较和分析。目前只适合benchmark的regression问题。 具体效果可参考 G.-B. Huang, L. Chen and C.-K. ...
计算最优化网络节点传输路径的neural network 模型,测试通过4个nodes...
Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree consists of a set of nodes (or vertices) and a set o...
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the co...
Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. This is a part of mine...