[matlab例程] imagerecognition

说明：it is a image recognition with rbf neural network
<parisa> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[数学计算/工程计算] mulVNewton

说明：非线性方程组的逆Newton法的matlab实现，代码简洁，算法精确！-Nonlinear equations inverse Newton method matlab implementation, code simplicity, the algorithm accurately!
<tony> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[matlab例程] EXP

说明：M文件编写的BP神经网络例子，有学习和识别的功能-M document prepared by the example of BP neural network, learn and identify the function
<weiwei> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[matlab例程] worfk

说明：matlab 源程序，一些有用的代码，欢迎下载，基础知识学习。-language of matlab important
<jyliu3> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[matlab例程] BREEDSO

说明：源码基于杂交的粒子群算法求解无约束优化问题，主要是各粒子的位置和速度.-Source code based on hybrid particle swarm algorithm for solving unconstrained optimization problems, mainly the particle position and velocity.
<李霞妮> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[matlab例程] xia_bo

说明：一个利用小波神经网络进行预测的例子源码。-The use of a wavelet neural network to predict the example source code.
<李霞妮> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[数据结构常用算法] DIJKSTRA

说明：Suppose you want to find the shortest path between two intersections on a map, a starting point and a destination. To accomplish this, you could highlight the streets (tracing the streets with a marker) in a certain order, until you have a route high
<synthia> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[数学计算/工程计算] mathbg

说明：With this C++ .h file you can convert from a decimal to a fraction number
<Krum> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[数据结构常用算法] KRUSKAL

说明： * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o
<synthia> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[数据结构常用算法] my_BFS

说明： 1. Enqueue the root node. 2. Dequeue a node and examine it. * If the element sought is found in this node, quit the search and return a result. * Otherwise enqueue any successors (the direct child nodes) that have not yet been discovered.
<synthia> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[数据结构常用算法] MY_DFS

说明：DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, retur
<synthia> 在 2025-07-04 上传 | 大小：1kb | 下载：0

[数据结构常用算法] MY_QUICK

说明： 1. Pick an element, called a pivot, from the list. 2. Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way
<synthia> 在 2025-07-04 上传 | 大小：1kb | 下载：0