资源列表
fuhua
- 计算方法复化求积公式-Minute calculation method of quadrature formula
Wilson法
- 数值计算的Wilson法代码
work9
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场，设计一个有效的贪心算法进行安排。-Enough to assume that many of the arrangements for the venue where a number of activities and want to use the venue as small as possible, design an efficient greedy algorithm to carry out the arrangemen
bpnnet_154
- L-M算法。除了动量法(基于梯度下降的训练算法)外，学习率自适应调整策略是BP算法改进的另一种途径，它利用Levenberg-Marquardt优化方法，从而使得学习时间更短。其缺点是，对于复杂的问题，该方法需要很大的存储空间。 -L-M algorithm. In addition to momentum (based on the gradient descent algorithm for training), learning rate adaptive strategy is to i
Untitled
- lvq神经网络的编程，分类效果明显，希望大家能用的上~-LVQ neural network programming, the classification results obviously, hope that we can use the on ~
MINTREE
- 最小生成树问题，稍有修改，大家看看，-Minimum spanning tree problem, slightly modified, we take a look at Hei hei
operation
- 对链表的基本操作，删除，插入操作，绝对能实现-The basic operation of the list, delete, insert, absolutely can achieve
matlab
- 汽车ABS防抱死系统 程序开发汽车 ABS防抱死系统 程序开发-ABS anti-lock braking system Automotive automotive ABS anti-lock braking system program development Program Development
main
- 中缀转换成后缀表达式有很多运用，例如可以用来构造查询表达式。本程序实现了中缀转换成后缀的算法-Infix expression into postfix to use a lot, for example, can be used to construct a query expression. Realized by the infix into postfix algorithm
shortest-path-problem
- 图与网络是运筹学（Operations Research）中的一个经典和重要的分支，所研究的 问题涉及经济管理、工业工程、交通运输、计算机科学与信息技术、通讯与网络技术等 诸多领域。下面将要讨论的最短路问题、最大流问题、最小费用流问题和匹配问题等都 是图与网络的基本问题。 我们首先通过一些例子来了解网络优化问题。 例1 最短路问题（SPP－shortest path problem）-shortest path problem）
Stone
- 用动态规划思路去解答石堆合并问题，已成功通过编译，调试-Using dynamic programming ideas to answer rubble merger, which has been successfully compile, debug
4-3solution
- 朋友圈，某学校有N个学生，形成M个俱乐部，每个俱乐部里的学生有着一定相似的兴趣爱好-Circle of friends, a school student with N form M clubs, each club has a certain similarity of student interests