搜索资源列表
modhmmc
- 马尔科夫模型的c语言实现，用于生物序列分析的好的参考，和java版本的可互相参考-Markov Model C Language for Biological Sequence Analysis of good reference java and the versions of each another
computerdisign-C
- 算法的设计方法(C程序):一、迭代法 二、穷举搜索法三、递推法 四、递归五、回溯法 六、贪婪法 -algorithm design method (C program) : 1, 2 iteration, the exhaustive search method three, four recursive method, recursive 5, backtracking 6, greedy algorithm
prim_rar
- prim算法 是一个比较常见的求最小生成树的算法,它用贪婪准则来编写算法的!-prim algorithm is a more common for the minimum spanning tree algorithm, which used to prepare guidelines for the greedy algorithm!
robot_lesson
- 一个使用贪婪算法解决机器人收集硬币问题的小练习。-use a greedy algorithm to solve the problem robot coin collection of small practice.
dtgh
- 和贪婪算法一样，在动态规划中，可将一个问题的解决方案视为一系列决策的结果。不同的是，在贪婪算法中，每采用一次贪婪准则便做出一个不可撤回的决策，而在动态规划中，还要考察每个最优决策序列中是否包含一个最优子序列。-and the greedy algorithm, the dynamic programming, can be a solution to the problem as the result of a series of po
greedy_tuopupaixu
- 介绍了贪婪算法在拓扑排序中的应用,对于学习贪婪算法很有用-of greed in topological sorting algorithm, the application learning greedy algorithm useful
student
- 一个关于结构体数据的文件读写操作实例. linux/c-Data on the structure of documents to read and write operation examples. Linux/c
ArithmeticDesignMethod
- 此文章的算法有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法等等，有用的的人可以-This article has iteration of the algorithm, exhaustive search method, the recursive method, greedy method, backtracking, sub-rule method, dynamic programming, etc., can b
GLJ
- 用贪婪算法寻找交换机的最佳匹配端口，效率比较高，时延抖动也比较小-Greedy algorithm used to find the best matching switch port, the efficiency is relatively high, delay jitter is also relatively small
ana
- 蚁群算法是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题-Ant colony algorithm is a combinatorial optimization problem to solve a new type of general-purpose heuristic method, th
tanlan_suanfa_2
- 这是C写的贪婪算法之2,在建摸和优化计算中非常有用,欢迎下载!-This is a greedy algorithm written in C of 2, in the modeling and optimization of the calculation is very useful are welcome to download!
x
- 背包问题的解决 :给定一个超递增序列和一个背包的容量,然后在超递增序列中选(只能选一次)或不选每一个数值,使得选中...解决0/1背包问题的方法有多种,最常用的有贪婪法和动态规划法。-Knapsack problem: given a super-increasing sequence and the capacity of a backpack, and then in the ultra-increasing sequence
tanlan
- 一种基于非贪婪策略的网络蜘蛛搜索,适用于人工智能中搜索的架构和研究的文章！-A greedy strategy based on non-network spider search, apply artificial intelligence to search for and study the structure of the article!
mimo_waterfilling
- MIMO_System.m MIMO系统建模 WaterFilling_alg.m 注水算法的源程序-MIMO_System.m MIMO system modeling algorithm WaterFilling_alg.m water source
mimo
- MIMO源码，注水定理源码，学习MIMO和注水定理的好-MIMO source, water source theorem, learning MIMO and good water theorem
81404573MIMO-OFDMchannelestimation
- MIMO-OFDM channel estimation 。是基于mmse准则的，欢迎大家下载使用。-MIMO-OFDM channel estimation. Is based on the MMSE criteria, welcomed everyone download.
suanfa2
- 贪婪法是一种不追求最优解，只希望得到较为满意解的方法。贪婪法一般可以快速得到满意的解，因为它省去了为找最优解要穷尽所有可能而必须耗费的大量时间。贪婪法常以当前情况为基础作最优选择，而不考虑各种可能的整体情况，所以贪婪法不要回溯。-Greedy method is a non-pursuit of the optimal solution, just want to be more satisfied with the solution
Knight
- 1． 我们采用了回溯法和贪婪策略来求解国际象棋中的骑士巡游问题。对于棋盘中的每个位置最多只有8个方向可以选择，我们可以定义两个数组var_x[MAX_DIR]和var_y[MAX_DIR]用来记录往这8个方向走相对应的坐标变化情况（其中MAX_DIR的值为8）。每走一步，都从方向0开始试探到方向7，而在这里我加入贪婪策略来提高算法的效率，即在选择方向时，我们优先选择具有如下性质的方向：当我们沿着这个方向走一步后，走到这一步后可选的方向最
tanlansuanf
- 本文运用贪婪算法求解背包问题，语言为C，很不错的-In this paper, the greedy algorithm knapsack problem, language as C, very good
algorithm.tar
- 一个算法教案，包括多精度数值处理、排列组合、枚举法、递归与回溯法、贪婪法等在章节-An Algorithm for lesson plans, including multi-precision numerical processing, permutation and combination, enumeration, recursive and backtracking, greedy method, such as in the