1) Game trees
对策树
1.
Game trees were first denned by Von Neumann and Morgenstern in 1944.
对策树首先由Von Neumann和Morgenstern在1944年提出并进行研究。
2) game tree search
对策树搜索
3) ordered tree of multi-stage matrix game
多步对策有序树
4) MCST
最小费用树对策
1.
Here we discuss the tactics between the bankruptcy and MCST in cooperation,and the relations among all of their answers.
讨论合作对策中破产对策与最小费用树对策的各种解之间的关系，通过构造网络图，给出了将破产问题化为最小费用树对策的一个充分条件，从而给出破产对策核仁解的一种有效方
5) Minimum cost spanning tree game
最小费用支撑树对策
1.
This paper develops Glover-Klingman algorithm and Minimu m cost spanning tree game to the Minimum cost k-degree constrained spanning tree game,formulate two strategies with the Threat theory and Side Payment theory,gi ves the solution in the Minimum cost spanning tree game core with dominate theor y and strategic equivalent theory,and proves that the core is non-empty under th e two rules.
本文在Glover-Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题。
6) Minimum cost k-degree costrained spanning tree game
最小费用限制树对策
补充资料：海南龙血树（小花龙血树）
百合科Liliaceae
乔木状，高3-4m。叶聚生于茎和枝顶，几呈套叠状，长约70cm，抱茎，无柄。圆锥花序长约30cm，花序轴无毛或近无毛。分布于海南西南部，生于背风区的干燥砂土上。越南、柬埔寨也有分布。国家三级保护濒危种。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条