1) greedy transform method
贪心变换法
2) greedy transform
贪婪变换
1.
This paper presents a discrete differential evolution algorithm with greedy transform.
针对0/1背包问题,提出一种融合贪婪变换的离散差分进化算法。
3) greedy algorithm
贪心算法
1.
Behavior analysis of electricity trade using transportation problem and greedy algorithm;
应用运输问题和贪心算法的电力交易行为分析
2.
The Method of the Downlink of Science Satellite Based on Greedy Algorithm;
基于贪心算法的科学卫星下行传输规划
3.
Design of greedy algorithm about interest arbitrage;
套利问题的贪心算法设计
4) Greedy algorithm
贪心法
1.
In the modified algorithm,a global objective function including a length term was introduced,and the greedy algorithm was used to merge the regions.
针对过分割问题提出了一种改进的Split-Merge算法,在合并过程中引入全局目标函数,并在目标函数中定义了长度项,使用贪心法完成合并过程。
2.
Considering the quilting path includes invalid journey between contours,the segment of contour is sorted topologically using greedy algorithm for invalid journey is shortened.
然后考虑到多轮廓图案绗缝时,针头的加工路径包含其在轮廓间移动的空行程,为缩短空行程,用贪心法对轮廓进行拓扑排序。
3.
In order to solve multi-constraint 0-1 knapsack problem, a new profit-density is designed, on basis of which, a Hybrid Genetic Algorithm(HGA) based on greedy algorithm is proposed, which uses the binary code to amend the feasible solution, and applies roulette wheel selection method to rectify knapsack resources with insufficient use, and repairs the infeasible solution.
为求解多限制0-1背包问题,设计一种新的价值密度,提出一种基于贪心法的混合遗传算法,采用二进制编码对适应值进行升序排列,并运用轮盘赌选择方法对背包资源利用不足的可行解进行修正处理,对不可行解进行修复处理,并将其与传统遗传算法进行比较。
5) Greedy method
贪心方法
1.
This paper will introduce five algorithm design methods, which are Greedy method, Dynamic programming, Backtracking, Branch and bound, Genetic algorithm, summarize their basic tenets, give the solving algorithm thought to 0/1 knapsack problem, analyse the algorithms and put forward the improving methods.
本文分别从贪心方法、动态规划、回溯法、分枝-限界法,遗传算法这五种算法设计方法入手,概述了各种设计方法的基本原理,提出了求解0/1背包问题的算法思想,并对算法进行分析,提出了改进方法。
2.
This paper introduces the concept about the question of job scheduling with time limit, a general method of solving this question using greedy method and a fast algorithm which is improved.
介绍了带有限期作业排序问题的概念,以及使用贪心方法求解此问题的一般算法和一种改进的快速算法。
6) greedy method
贪心法
1.
Interactive timetabling approach based on greedy method and tabu search;
基于贪心法和禁忌搜索的实用高校排课系统
2.
This paper adopts dynamic programming method and greedy method to solve such problems, then analyzes and compares the differences of two algorithms.
采用动态规划法和贪心法对该问题进行求解,分析和比较这两种算法在求解同一问题时的差异。
补充资料：Radon变换和逆Radon变换
Radon变换和逆Radon变换
X线物理学术语。CT重建图像成像的主要理论依据之一。1917年澳大利亚数学家Radon首先论证了通过物体某一平面的投影重建物体该平面两维空间分布的公式。他的公式要求获得沿该平面所有可能的直线的全部投影(无限集合)。所获得的投影集称为Radon变换。由Radon变换进行重建图像的操作则称为逆Radon变换。Radon变换和逆Radon变换对CT成像的意义在于，它从数学原理上证实了通过物体某一断层层面“沿直线衰减分布的投影”重建该层面单位体积，即体素的线性衰减系数两维空间分布的可能性。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条