搜索资源列表
ders4_2007
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders5_2007
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders6_2007
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders7_2006
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders8_2006
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
coloring
- Coloring algorithm with greedy method in C-Coloring algorithm with greedy method in C++
kruskal
- implementation Kruskal algorithm with greedy method in C-implementation Kruskal algorithm with greedy method in C++
SUANFAPPT
- 常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) -Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm
seg-ijcv
- This paper addresses the problem of segmenting an image into regions. We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e±cient segmentation
lvxing
- 旅行商问题是NP完全的组合优化问题。分析了邻域启发式算法的基本操作,提出 一种简单的启发式贪心法,仅利用城市间的距离信息求解旅行商问题-Traveling salesman problem is np-complete combinatorial optimization problem.The basic operation of neighborhood heuristic algorithm is analyzed and presented A simple heuristic
2003年全国大学生数学建模竞赛题目
- 如何利用最小的资源消耗取得理想的产量要求,是本文讨论的重点问题。文章采用两种方法——贪心法和线性规划建立模型，针对两个目标进行安排。(How to make use of the minimum resource consumption to achieve the desired output requirements is the key issue discussed in this paper. In this paper, two methods, greedy method and