资源列表
Crank-Nicolson
- 针对有界区域上的抛物型微分方程讨论了Crank-Nicolson块中心差分法,在非等距剖分的网格上得了近似解和解的一阶导数的L2模误差估计-For a bounded region of parabolic differential equations discussed the Crank-Nicolson central difference blocks, in a non-equidistant grid had split the approximate solution of the
Test
- 交换两个字符串指定的位置后面的字符串，结果是返回一个字符串数组，第一个是第一个字符串，第二个是第二个字符串。-swap to Strings with the specified location,return an array of string,the first is the first strings ,and the other is the second one.
BST
- 用动态规划解答最优二叉查找树问题，最优二叉搜索树-Using dynamic programming solution optimal binary search tree problem with Optimal binary search tree
0-1
- 用动态规划思路去解答经典的0-1背包问题，已成功通过调试-Using dynamic programming ideas to answer the classic 0-1 knapsack problem, has successfully passed the debugging
Stone
- 用动态规划思路去解答石堆合并问题，已成功通过编译，调试-Using dynamic programming ideas to answer rubble merger, which has been successfully compile, debug
LJ
- 用动态规划思路去解答零件加工顺序问题，已成功通过，编译调试-Using dynamic programming ideas to answer parts processing sequence, which has been successfully passed, the compiler debugging
0-1Jump
- 用动态规划去解答0-1背包问题，此方法是在经典背包问题上进行的跳跃点优化而解答出来的，已成功通过编译调试-Using dynamic programming to answer 0-1 knapsack problem, this method is carried out on the classic knapsack problem jumps out optimization solutions, has successfully passed the compiler debugging
GearDesigner
- 齿轮配齿计算，自动筛选满足指定比率的整数配齿-Computation of gear system
BucketOrders
- 桶序挖掘，即从一组关于多个对象的排列中挖掘出一个桶排列，可以应用到很多方面，例如文档标记的产生、用户浏览网页习惯分析、化石现场的时序挖掘等问题。桶序，即一组对象的有序划分，其中桶与桶之间形成一个全序，而同一桶内的对象之间无先后顺序。-Digging bucket sequence, from a group of a plurality of objects arranged on a digging bucket arrangement can be applied to many areas
2007611180679955989
- OMV计算程序,在matlab环境下开发-OMV calculation program development environment in matlab
nway330
- matlab 精通一书源代码，包含各个重点章节偶-proficient in a book matlab source code, including various chapters focus even
Fastexp
- fast exponential calculation with data get from a txt file