搜索资源列表
SUANFAPPT
- 常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) -Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm
algorithm
- 以设计策略为主线,循序渐进地介绍了经典算法设计(包括分治、动态规划、贪心、回溯、迭代改进等算法)、NF完全理论、非精确型算法设计〔包括近似算法、参数化算法,随机算法),以及现代智能优化方法.强调算法思维与编程实践并重,注重运用算法技术解决实际工程问题。-In order to design strategy as the main line, gradual introduction of the classic algorithm design (including the partition
COOMP
- Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly coherent
greedy
- 贪婪算法,可以实现最优的资源分配策略,给小白们作为参考-Greedy algorithm, you can achieve the optimal allocation of resources strategy, to white people as a reference