在此基础提出了一种带时间延迟的因果图迭代推理算法，并分析了算法的时间复杂度。

Then, an iterative reasoning algorithm of TDCD is put forward, and its computational time complexity is analyzed.

youdao

分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 - OPT算法计算时间的平均复杂度。

The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.

youdao

提出了带记忆组合器的非线性复杂度和相关免疫阶的概念。

The concepts of nonlinear complexity and correlation immune order of combiner with memory are proposed in this paper.

youdao