资源列表
main
- main speech processing-main in speech processing
ppts
- POWER ELECTRONICS PPTS
fwdmcck1
- 蒙特卡罗法求一维平板上探测器的热流，算例为Modest书中第10章第一个算例。-Monte Carlo method for the one-dimensional heat flow detector plate, Modest examples for the book, Chapter 10, a numerical example.
Optimal-scheduling-independent-tasks
- 对于给定的2台处理机A和B处理n个作业，找出一个最优调度方案，使2台机器处理完这n个作业的时间最短。-Optimal scheduling independent tasks.
sdfdff
- 描述算法的基本内容 是学习的好工具 很适合初学者-Describe the basic content of the algorithm is a good tool for learning is very suitable for beginners
Signal-enhancement-device
- 信号增强装置问题要求对于一个给定的信号传输网络，计算如何放置最少的信号增强装置来保证网络传输的畅通。 对于给定的带权树，计算放置信号增强装置最少数量。 -Signal enhancement device for a given problem requires the signal transmission network, calculating how to place a minimum of signal enhancement device to ensure the smo
Flow-shop-scheduling
- 流水作业调度问题要求确定这n个作业的最优加工顺序，使得从第一个作业在机器 上开始加工，到最后一个作业在机器 上加工完成所需的时间最少。-Flow-shop scheduling problem requires to determine that the optimal n-job processing sequence, so the first job from start processing on the machine, to the last job on the machine p
0-1-knapsack-problem
- 01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。在本例中所有数值均为整数-01 M items in the backpack is out of a number of pieces on the space W of the backpack, the size of each item as W1, W2 ... ... Wn, corresponding to the value of
At-least-the-issue-of-coins
- 有n种不同面值的硬币，各硬币面值存于数组T[1:n] 现用这些面值的钱来找钱；各面值的个数存在数组Coins[1:n]中。 对于给定的1<=n<=10，硬币面值数组、各面值的个数及钱数m，0<=m<=2001，编程计算找钱m的最少硬币数。 -There are n different denominations of coins, each coin denomination stored in the array T [1: n] current face v
DTW-algorithm
- 利用C++实现的动态时间序列弯曲算法，计算时间序列距离，可用于相似匹配-DTW algorithm based on C++,which can be used for distance computing,and similarity match
maze
- 电脑鼠迷宫记录源码 电脑鼠迷宫记录源码-Record source computer mouse mazeRecord source computer mouse mazeRecord source computer mouse maze
Mouse_Drive
- 电脑鼠走迷宫算法中队电脑鼠进行相关驱动的算法源码-Computer mouse computer mouse maze algorithm Squadron driven algorithm for source-related