资源列表
95637012Multiplier
- 一种可以完成16位有符号／无符号二进制数乘法的乘法器。该乘法器采用了改进的booth算法，简化了部分积的符号扩展，采用Wallace树和超前进位加法器来进一步提高电路的运算速度。本乘法器可以作为嵌入式CPU内核的乘法单元，整个设计用VHDL语言实现。- This file contains all the entity-architectures for a complete-- k-bit x k-bit Booth multiplier.-- the design makes use of
RBF
- this matlab code for rbf-this is matlab code for rbf
SPHForPoiseuilleFlow
- SPH计算泊肃叶流动,利用周期边界条件和虚拟粒子固壁条件-SPH Code for poiseuille Flow by peoriodic boundary condtion
vector
- 当然矩阵的加减乘也是十分的重要，国内外都是如此，进行大型的科研项目，涉及到复杂的线性代数，行列式，以及电路分析图都会用到矩阵的基本运算。但是就目前来看，学生对矩阵运算的研究还很少，不够理解和熟悉，于是我们就要提供更多的信息和软件的帮助。-Matrix addition and subtraction, multiplication is of course very important, are so at home and abroad, large-scale research projec
danchunxing
- 用插值法画出正弦曲线， 可以实现正弦曲线上升段的截取。-Can realize the interception of the rising segment in the sine curve
danchunxing1
- 用优化方法中单纯型的思想，转换为矩阵的变化，巧妙的求解线性和非线性方程组的解 -With optimization method of the type of pure thought for the change of the matrix, conversion, clever to solve the linear and nonlinear equations solution
horse
- 用JAVA写的一个比较好的骑士巡游问题的解决代码，时间复杂度极低-Written with JAVA A good knight' s tour solution to the problem code, the time complexity is very low
4.2
- 哈弗曼编码的一个JAVA实现的算法，时间复杂度极低-Ha Fuman encoding a JAVA implementation of the algorithm, time complexity is very low
4.1
- 经典汽车加油问题的算法解决方案，时间复杂度小-Classic car fuel problem solution algorithm, time complexity is small
4.3
- 硬币找钱问题的解决方案，时间复杂度小，方法十分方便-Coin find money solution to the problem
3.1
- 最长公共秩序列经典问题的源代码，可以直接用-Up to the classic problem of public order out the source code can be directly used
47651492kriging
- 一个短小但可用的克里金插值算法程序，使用时注意不要有太多的点，如果点太多效率会急剧恶化，改进办法是分块送入数据点-A short but available Kriging algorithm, don t try to calculate too many points, if points are too many sharp deterioration in efficiency, improved approach is divided into blocks of data point