基于轮廓提取的多边形近似匹配算法 matlaB编的

该工程是opencv提取障碍物轮廓，然后进行多边形近似，之后为了设置安全距离，对多边形顶点进行外扩，最后连成直线并显示出来。 原理以及效果见博客https://blog.csdn.net/hjk61314/article/details/82112610

2019年1月25日学习率对神经网络迭代次数和准确率的影响以及近似的数学表达式-实验数据

利用matlab代码实现近似熵算法 并以两个合成数据为例

这本书在国内已经绝版。目录如下 Introduction Dorit S. Hochbaum 0.1 What can approximation algorithms do for you: an illustrative example 0.2 Fundamentals and concepts 0.3 Objectives and organization of this book 0.4 Acknowledgments I Approximation Algorithms for Scheduling Leslie A. Hall 1.1 Introduction 1.2 Sequencing with Release Dates to Minimize Lateness 1.2.1 Jacksons rule 1.2.2 A simple 3/2-approximation algorithm 1.2.3 A polynomial approximation scheme 1.2.4 Precedence constraints and preprocessing 1.3 Identical parallel machines: beyond list scheduling 1.3.1 P|rj,prec|Lmax:: list scheduling revisited 1.3.2 The LPT rule for P‖Cmax 1.3.3 The LPT rule for P|rj|Cmax 1.3.4 Other results for identical parallel machines 1.4 Unrelated parallel machines 1.4.1 A 2-approximation algorithm based on linear programming 1.4.2 An approximation algorithm for minimizing cost and makespan 1.4.3 A related result from network scheduling 1.5 Shop scheduling 1.5.1 A greedy 2-approximation algorithm for open shops 1.5.2 An algorithm with an absolute error bound 1.5.3 A 2 E -approximation algorithm for fixed job and flow shops 1.5.4 The general job shop: unit-time operations 1.6 Lower bounds on approximation for makespan scheduling 1.6.1 Identical parallel machines and precedence constraints 1.6.2 Unrelated parallel machines 1.6.3 Shop scheduling 1.7 Min-sum Objectives 1.7.1 Sequencing with release dates to minimize sum of completion times 1.7.2 Sequencing with precedence constraints 1.7.3 Unrelated parallel machines 1.8 Final remarks 2 Approximation Algorithms for Bin Packing: A Survey E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson 2.1 Introduction 2.2 Worst-case analysis 2.2.1 Next fit 2.2.2 First fit 2.2.3 Best fit, worst fit, and almost any fit algorithms 2.2.4 Bounded-space online algorithms 2.2.5 Arbitrary online algorithms 2.2.6 Semi-online algorithms 2.2.7 First fit decreasing and best fit decreasing 2.2.8 Other simple offline algorithms 2.2.9 Special-case optimality, approximation sche

符合闭合水准近似平差程序 符合闭合水准近似平差程序 符合闭合水准近似平差程序 符合闭合水准近似平差程序 符合闭合水准近似平差程序

matlab计算粗糙集的下近似属性依赖度和条件熵，

设施选址问题的近似算法，花钱买的电子版，是图片PDF。

近似算法描述的集合覆盖问题，其实也是NP难问题，里面包括了详细的讲解，还有用C++语言的描述，里面还包括集合覆盖的算法代码、设计文档。我在很多书上并没能找到这样详细的描述和实现，不敢大学课本上的，还是外国著名工程师写的书都没用代码实现。大家如果觉得不错的话，评论一句，谢谢！