资源列表
[数学计算/工程计算] MATLABOptimization-methods
说明:关于一些最优化算法的资料,使用matlab编程实例-matlab examples of nonlinear equations, and some algorithms, it is practical<李亚> 在 2025-09-12 上传 | 大小:175kb | 下载:0
[单片机(51,AVR,MSP430等)] 2
说明:通电启动后,默认状态是读出E2PROM中保存的电机走纸的长度并显示,显示的走纸长度可以通过键盘重新设置-After power-up, the default state is stored in E2PROM read the paper feed motor length and display, the displayed paper feed length can be reset via the keyboard<> 在 2025-09-12 上传 | 大小:1kb | 下载:0
[其他小程序] BinaryIterate
说明:已知前序、中序遍历,求后序遍历.比较笨的方法是画出来二叉树,然后根据各种遍历不同的特性来求,也可以编程求出.-Known pre-order, preorder, seeking after preorder. Stupid way is to draw out the tree, and then iterate based on a variety of different features to find, but also can be programmed to calculate.<tscorner> 在 2025-09-12 上传 | 大小:1kb | 下载:0
[数据结构常用算法] BinaryTreeIterate
说明:已知中序和后序遍历,求前序遍历.比较笨的方法是画出来二叉树,然后根据各种遍历不同的特性来求,也可以编程求出.-Known inorder and postorder traversal, seeking preorder traversal. Stupid way is to draw out the binary tree, and then iterate based on a variety of different features to find, but also can be pr<tscorner> 在 2025-09-12 上传 | 大小:1kb | 下载:0
[数据结构常用算法] UndirectedGraph
说明:遍历一遍,判断图分为几部分(假定为P部分,即图有 P 个连通分量),对于每一个连通分量,如果无环则只能是树,即:边数=结点数-1,只要有一个满足边数>结点数-1,原图就有环. -Traverse again, the determination map is divided into several parts (assumed to section P, with P in Figure connected component), for each connected compone<tscorner> 在 2025-09-12 上传 | 大小:1kb | 下载:0
[matlab例程] yuyinjisuanqi
说明:基于dtw的能够进行语音识别的计算器,打开yuyinjisuanqi.m运行-based on dtw,this calculator can recognize voice of input.Open yuyinjisuanqi.m to excute the program<梁粤> 在 2025-09-12 上传 | 大小:2.86mb | 下载:0