at the same time, a large number of experimental data shows that the delimitation greedy algorithm has better results than the hitting set algorithm.
同时大量实验数据表明,定界贪心算法与碰集算法相比具有更好的计算性能。
this paper proposes an improved statistical hitting set attack(shs-attack)based on mix anonymity technique and a defence strategy based on dummy packets to counter against this attack.
基于mix匿名系统模型,提出一种改进的统计命中集攻击算法,并在该算法的基础上给出基于填充包的防御策略。
in our actual test experiments, each instance can be completed better by delimitation greedy algorithm than hitting set algorithm.
在实际测试实验中,未曾遇到定界贪心算法性能不如碰集算法性能好的实例。