说明：M文件编写的BP神经网络例子，有学习和识别的功能-M document prepared by the example of BP neural network, learn and identify the function <weiwei> 在 2025-02-03 上传
| 大小：1kb | 下载：0
说明：源码基于杂交的粒子群算法求解无约束优化问题，主要是各粒子的位置和速度.-Source code based on hybrid particle swarm algorithm for solving unconstrained optimization problems, mainly the particle position and velocity. <李霞妮> 在 2025-02-03 上传
| 大小：1kb | 下载：0
说明：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 orde <synthia> 在 2025-02-03 上传
| 大小：1kb | 下载：0
说明： * 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 wi <synthia> 在 2025-02-03 上传
| 大小：1kb | 下载：0
说明： 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 h <synthia> 在 2025-02-03 上传
| 大小：1kb | 下载：0
说明：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. The <synthia> 在 2025-02-03 上传
| 大小：1kb | 下载：0
说明： 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 ( <synthia> 在 2025-02-03 上传
| 大小：1kb | 下载：0
说明：This program is ploting EM Plane wave propagation and reflection from Dielectric slab-This program is ploting EM Plane wave propagation and reflection from Dielectric slab <Helen> 在 2025-02-03 上传
| 大小：1kb | 下载：0
