A greedy algorithm and an efficient candidate_based algorithm are proposed.
一个贪婪算法和一个基于候选集的快速算法是压缩频繁序列模式集的有效算法。
参考来源 - 挖掘序列模式和结构化模式的精简集It is the optimal target to maximize access subscribers. Greedy algorithm of discrete optimal method was used to get the optimal solution.
为获得该优化问题的最优解,采用了离散优化方法中的贪婪算法。
参考来源 - 多用户OFDM和MIMOEspecially, the water-filling method with the integer bit constraint is researched and a modified greedy method and a bisection bit allocation method are proposed, respectively.
重点研究了在实际系统中整数比特约束下的注水法则,提出了一种改进的贪婪算法和一种对分比特分配算法。
参考来源 - 多载波与合作通信系统中的资源优化分配研究Based on the model, the hybridscheduling algorithm derived from the greed algorithm and tabu search is proposed,which implements the schedule automation, and consequently improves theInternet-based sharing efficiency of NC resource.
依据该模型,设计了禁忌搜索和贪婪算法相结合的调度算法,实现了共享数控任务调度的自动化,提升了数控资源的共享效率。
参考来源 - 面向资源共享的数控任务相似关联分析及调度优化研究·2,447,543篇论文数据,部分数据来源于NoteExpress
我们从贪婪的贼开始,这个贪婪的贼按贪婪算法行动。
We'll start with the greedy thief. Well, the greedy thief follows the greedy algorithm.
我应该会有完全相同的比赛,每次运行与贪婪算法?
Should I expect to have exactly same match everytime I run the match with greedy algorithm?
如果年贪婪算法你会带走什么呢?,这个贼做的第一件事是什么?
What do you get if you follow the greedy algorithm? What's the first thing the thief does?
Where have we implemented a greedy algorithm, or have been asked to do a greedy algorithm? Well, there are not that many things you guys have been working on this semester.
现在你已经实施了一个贪婪算法,我们在哪里实施了贪婪算法,或者我们那里被要求实施贪婪算法呢?,们这学期不需要用什么功对吧?
But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.
但是让我们找一找它的一些变种,在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。
What do you get if you follow the greedy algorithm? What's the first thing the thief does?
如果年贪婪算法你会带走什么呢?,这个贼做的第一件事是什么?
应用推荐