研究资源管理中的带宽和速率分配，将合作博弈算法用于超宽带技术中的资源管理。
The study does researches in bandwidth and rate control of resource management. Cooperative game theory is used for resource allocation.
基于博弈树的构建 ，对传统的博弈算法进行了分析研究 ，指出了其存在的不足。
This paper gives profound research is game-tree search algorithm and game-tree optimization technique.
瓦格纳和阿尔金使用互赖理论和博弈论来开发算法，评估在特殊场景下欺骗的价值。
Wagner and Arkin used interdependence theory and game theory to develop algorithms that tested the value of deception in a specific situation.
在最后，通过与程序或和人进行博弈对比判断该五子棋算法的优劣。
At the end, through playing chess with the people to judge the quality of this gobang algorithm.
在匹配博弈分配算法中，将频谱分配问题抽象成一个双边市场匹配问题，使用延迟接受算法将频谱分配给用户。
In matching game spectrum allocation algorithm, spectrum allocation problem is abstracted to a two-sided matching market problem, assignment spectrum to user by using deferred acceptance algorithm.
在研究了合作博弈论的基础上提出了一种适用于单载波系统的一对一匹配博弈频谱分配算法。
Through research on cooperative game theory, a one to one matching game spectrum allocation algorithm which can be used in single carrier system is proposed in this paper.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
针对如何解算n人非合作的动态博弈对策中的纳什均衡解问题，提出一种利用退火回归神经网络极值搜索算法解算纳什均衡解的方法。
An algorithm is proposed to solve the Nash equilibrium solution for ann-person noncooperative dynamic game by an annealing recurrent neural network for extremum seeking algorithm (ESA).
实验结果证明，该算法不但能保证博弈水平，还能得到较好的搜索效率。
The result shows that the algorithm can not only guarantee the game level, but also improve its search efficiency.
该算法将封闭世界模型上的概念图推理转化为对博弈树根节点的可解性标示过程。
The algorithm translates the inference of Conceptual-Graphs, in a Closed World Model, to marking processes in Game-Trees.
在理论分析的基础上，提出了协同博弈的强化学习算法，并证明了算法的收敛性。
On the basis of theoretical analysis, the cooperative game reinforcement learning method is proposed and its convergence is proved.
基于模拟退火算法，给出了博弈学习的一个改进方法，建立了寡头垄断市场的博弈学习模型。
Therefore, based on simulated annealing algorithm, an improved method of game learning was given and a game learning model about oligarch holding the market was established.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
在此基础上提出基于对方兴趣点的爬山式搜索算法，彻底解决了传统博弈论多属性谈判模型中计算量大而无法实现的问题。
On the basis of this model, a "hill climbing" -search algorithm was put forward to solve negotiation models with multi-attribution based on the traditional game theory field.
这是一个理论计算机科学和算法博弈论的题目。
This is a proposal in theoretical computer science and algorithmic game theory.
该文提出了一种基于博弈论的函数优化算法。
In this paper, we propose a novel optimization problem based on Game Theory.
提出一种基于博弈论的多目标量子粒子群算法。
This paper presents a multi-objective quantum Particle Swarm Optimization(PSO) based on game theory.
针对无线传感器网络能耗不均匀的问题，提出了一种基于博弈论模型的能量平衡路由(gtebr)算法。
A game theoretic energy balance routing (GTEBR) algorithm was proposed to avoid unevenly energy consuming in wireless sensor networks.
通过假设网格环境和设置相应变量，基于博弈理论建立了网格资源分配机制和竞价策略博弈模型，并应用动态规划算法证明了纳什均衡的存在。
From assuming the grid environment and set variables, the thesis founded a grid resource allocate mechanism and a biding policy model, proved the existent of Nash Equilibrium.
通过假设网格环境和设置相应变量，基于博弈理论建立了网格资源分配机制和竞价策略博弈模型，并应用动态规划算法证明了纳什均衡的存在。
From assuming the grid environment and set variables, the thesis founded a grid resource allocate mechanism and a biding policy model, proved the existent of Nash Equilibrium.
应用推荐