假设不确定性为矩阵多胞形结构不确定性，利用矩阵的秩- 1分解，得出系统鲁棒稳定的充分条件。
We also derive the sufficient conditions of robust stability by rank-1 decomposition of the matrix under the assumption that uncertainty is matrix polytope structured uncertainty.
由于逻辑程序的可分解属性具有不确定性，因此寻找适用范围更广的分解算法有待于进一步研究。
Because the factorization attribute of logic program possess the property of uncertainty , exploring the fargoing factorizing algorithm need further study.
由于逻辑程序的可分解属性具有不确定性，因此寻找适用范围更广的分解算法有待于进一步研究。
Because the factorization attribute of logic program possess the property of uncertainty , exploring the fargoing factorizing algorithm need further study.
应用推荐