检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《数学的实践与认识》2008年第8期169-173,共5页Mathematics in Practice and Theory
摘 要:讨论一类二元对策问题.在对策双方能力不同的情况下,推导对策双方获胜的充要条件和获胜方获胜的具体对策方案.文后的应用实例说明,本文所讨论的问题具有一定的应用价值.We consider a class of duality countermeasure problems in which the participants are of different potentials. We obtain some sufficient and necessary conditions for each side to win the game if each side of the game participant does not commit any mistakes. We also give the optimal strategy for each side of the participants to follow in the process of the duality countermeasure game, At the end of this paper, we give some applications of the results obtained in this paper.
分 类 号:O225[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112