松弛度 meaning in Chinese

degree of relaxation
slackness

An improved least - laxity - first scheduling algorithm for periodic tasks
改进的最低松弛度优先周期任务调度算法
This paper studies the relaxed game chromatic number of partial k - tree with the relaxed degree d
本文主要研究的是偏k -树在松弛度为d的情况下的松弛竞赛色数问题。
The relaxed game chromatic number of tree , outerplanar graphs , partial k - tree and pseudo partial k - tree have been studied by many researchers home and abroad , this paper further studied the relaxed game chromatic number of partial k - tree based on the known research , according to appling a new activation strategy , we proved if the relaxed degree d > 2k + 1 , then for this ( r , d ) - relaxed coloring game , we have ( 2k + 1 ) - xg ( g ) < k + 1 , it is an improvement about the result in paper [ 2 ]
对树，外平面图，偏k -树及伪偏k -树的松弛竞赛染色已在不同程度上得到了一些研究，并取得了一些相应的结果。本文正是在已有研究的基础上，对偏k -树的松弛竞赛色数进行了进一步的研究，使得在松弛度d不小于2k + 1的情况下，对这个( r ， d ) -松弛竞赛染色，有，它是文章[ 2 ]中结果的一个很好的改进。