为了使问题可解，我们假定每个节点在开启后将一直保持工作状态。
To make both problems tractable, we have the assumption that each sensor node keeps working since it turns on.
该算法将封闭世界模型上的概念图推理转化为对博弈树根节点的可解性标示过程。
The algorithm translates the inference of Conceptual-Graphs, in a Closed World Model, to marking processes in Game-Trees.
理论分析结果表明：策略中的编码信息包在所有接收节点具有可解性，可以达到重传目的。
The theoretic analysis shows that the approach ensures the solvability in the received nodes and achieves retransmission.
应用推荐