标记算法 meaning in Chinese
marker algorithm
marking algorithm
Examples
- A new algorithm for recursion marking of infrared image
一种新的红外二值图像递归标记算法 - Research on the effectiveness of probabilistic packet marking
基于概率包标记算法的安全技术研究 - Card marking algorithms can add as little as two or three machine instructions per non - initializing heap pointer store , and entails scanning any objects on dirty cards at minor collection time
对每一个非初始化堆指针存储，卡片标记算法可以只增加两到三个机器指令，并要求在小的收集时对所有脏卡片上的对象进行扫描。 - " , urs hoeltze covers both the classical card - marking algorithm and an improvement that can reduce the cost of marking significantly by slighly increasing the cost of scanning dirty cards at collection time
”中， urs hoeltze讨论了经典的卡片-标记算法以及通过稍微增加收集时扫描脏卡片的成本而显著减少标记成本的一个改进。 - Differentiated from the former markers , afm neither aims at some certain factors , nor tries to establish a precise mathematic model . on the contrary , afm follows a rule of result - oriented and reallocates the network resources in an adaptive manner , and thus gains high performance in the fairness of bandwidth sharing ; 3 ) the congestion control mechanisms of the current tcp have been proved to be effective for prevention of network collapse . however , with the development of network technologies , the insufficiencies of tcp are becoming increasingly severe , especially in the environment of heterogenous networks , the throughput performance of tcp is disappointing
与以往的标记算法不同的是，该算法并不针对具体某一个因素对公平性的影响，也不试图建立一个精确的数学模型，而是按“结果导向”以一种自适应的方式来对可用的网络资源进行重新分配，从而获得很高的公平性； 3 ) tcp协议的拥塞控制机制已经被证明能有效地防止网络崩溃的发生，但随着网络技术的发展， tcp协议的一些局限性也已经暴露出来了，尤其是在异构网络环境下，其吞吐量性能表现令人堪忧。