搜索资源列表
algorithm
- 以设计策略为主线,循序渐进地介绍了经典算法设计(包括分治、动态规划、贪心、回溯、迭代改进等算法)、NF完全理论、非精确型算法设计〔包括近似算法、参数化算法,随机算法),以及现代智能优化方法.强调算法思维与编程实践并重,注重运用算法技术解决实际工程问题。-In order to design strategy as the main line, gradual introduction of the classic algorithm design (including the partition
seg-ijcv[1]
- Graph-Based Segmentation 是经典的图像分割算法,该算法是基于图的 贪心聚类 算法,实现简单,速度比较快,精度也还行。-Graph based Segmentation is a classical image Segmentation algorithms, the algorithm is Based on the figure of greedy clustering algorithm, speed is faster, and easy to implement
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