助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   coalition structure 的翻译结果: 查询用时:0.18秒
图标索引 在分类学科中查询
所有学科
自动化技术
计算机软件及计算机应用
企业经济
经济理论及经济思想史
数学
宏观经济管理与可持续发展
更多类别查询

图标索引 历史查询
 

coalition structure
相关语句
  联盟结构
     A Dynamic Formation Algorithm of Multi-Agent Coalition Structure
     多Agent联盟结构动态生成算法
短句来源
     A kind of Method for Quick Constructing Optimal Coalition Structure
     一种快速构建最优联盟结构的方法
短句来源
     This problem can be solved through searching in the coalition structure graph or computing directly.
     这可以通过在联盟结构图上搜索或直接计算。
     An Anytime Coalition Structure Generation Algorithm
     一种任一时间联盟结构生成算法
短句来源
     This is the optimal coalition structure generation problem.
     这就是最优联盟结构生成问题。
更多       
  “coalition structure”译为未确定词的双语例句
     To solve the number of coalition structure increase rapidly, algorithm SCS (search of coalition structure), fast dynamic formation of Agent coalition, is given.
     针对多Agent联盟数量是Agent个数指数倍的问题,基于Agent合作收益独立性,给出了Agent联盟快速动态生成算法——SCS(search of coalition structure)算法;
短句来源
     Dynamic coalition structure is a profit-drive MRS architecture, which isglobal distributed while local weakly centralized.
     动态联合是全局分布而局部集中以利益驱动的多机器人系统体系结构。
短句来源
     Based on profound investigations and analyses of agents coalition structure and formation, coalition problems are separated into two types in this paper. The mathematical models of these two types of problem are also been founded.
     本文在全面分析和研究Agents联盟的结构和形式的基础上,将Agents联盟问题分为两种类型,并为这两种问题建立了数学模型。
短句来源
  相似匹配句对
     The structure of P.C.
     大跨度预应力混凝土斜拉桥(简称P.C.斜拉桥)结构不仅经济、美观,而且可以采用悬臂浇筑方法施工、使这一桥型得以迅速推广。
短句来源
     On ITS Structure
     论ITS的结构体系
短句来源
     This is the optimal coalition structure generation problem.
     这就是最优联盟结构生成问题。
     Coalition Structure Generation with Given Required Bound
     给定限界要求的联盟结构生成
短句来源
查询“coalition structure”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  coalition structure
Alonso-Meijide and Fiestras-Janeiro (2002, Annals of Operations Research 109, 213-227) proposed a modification of the Banzhaf value for games where a coalition structure is given.
      
The grand coalition, which is the efficient coalition structure, always belongs to the largest consistent set and is the unique one to belong to the largest cautious consistent set.
      
Analogously we introduce a Banzhaf coalition structure share function.
      
The Shapley value has been generalized by Owen to TU-games in coalition structure.
      
In this paper we consider TU-games in which the players are organized into a coalition structure being a finite partition of the set of players.
      
更多          


Minimum arborescence (MA) games are discussed in this paper. It is found that an MA game has a nonempty core and is permutationally convex. For MA games with efficient coalition structures, MA games on the components of the structure are constructed, and it is shown that the core of the original game is the cartesian product of the cores of the induced games on the components of the efficient coalition structure.

讨论有向图上最小树形图对策模型.证明了核心解集非空及置换凸性,给出了一种有效联盟结构分解

Coalition formation is a key topic in the research of multi-agent systems. The goal is to maximize benefits of the system via finding the coalition structure that maximizes the sum of values of all coalitions. But the number of coalition structures is often too large to allow exhaustive search for the optimal one. Thus emerges the meaningful problem: when practical applications can present required real bound on the worst case, and how to attain this demand within minimal amount of search?...

Coalition formation is a key topic in the research of multi-agent systems. The goal is to maximize benefits of the system via finding the coalition structure that maximizes the sum of values of all coalitions. But the number of coalition structures is often too large to allow exhaustive search for the optimal one. Thus emerges the meaningful problem: when practical applications can present required real bound on the worst case, and how to attain this demand within minimal amount of search? The algorithm presented in this paper solves this problem within minimal levels amount of search. Sandholm et al. have proved that in order to establish any worst case bound K(n), it is necessary to search the lowest two levels of the coalition structure graph, and the bound is n(the number of agents). Based on this,using our algorithm, after the search of the lowest two levels, the bound K(n)3 can be attained with the searching of only one level, and the bound K(n)2 can be attained with the searching of two levels at most. Using our algorithm, the amount of search needed to attain the bound is drastically cut down compared with the algorithm proposed by Sandholm et al.

联盟形成是多 Agent系统中的一个关键问题 ,目的是通过寻找使联盟值的总和最大的联盟结构来使系统得到最大的效益 .但通常可能的联盟结构的数目太大 ,不允许穷尽搜索来找出最优解 .当实际问题提出最坏情况的具体限界要求时 ,如何以最小的搜索达到这个要求是需要解决的 .文中给出的算法对给定的限界要求 K* 2以最少的搜索层数解决了这个问题 . Sandholm等人已经证明 ,要建立最坏情况下的限界 K ( n) ,搜索联盟结构图的最底两层是必要且是充分的 ,此时限界是 n(系统的 Agent数 ) .以此为基础 ,文中给出了算法 ,在搜索最底两层之后 ,只要搜索一层就能保证 K( n) 3 ;而在搜索最底两层之后 ,最多搜索两层就能保证 K( n) 2 .与 Samdholm等人给出的算法相比 ,文中给出的算法达到指定限界的搜索量显著减少 .

Coalition formation is a key topic in multi agent systems. People try to search for coalition structure that maximizes the sum of the values of the coalitions, but in most cases the number of coalition structures is too large to search for the optimal one exhaustively. In this paper, an algorithm is presented that within the minimal amount of search can guarantee to find a coalition structure which is within a bound from optimum. Then, the anytime algorithm searches further, and establishes...

Coalition formation is a key topic in multi agent systems. People try to search for coalition structure that maximizes the sum of the values of the coalitions, but in most cases the number of coalition structures is too large to search for the optimal one exhaustively. In this paper, an algorithm is presented that within the minimal amount of search can guarantee to find a coalition structure which is within a bound from optimum. Then, the anytime algorithm searches further, and establishes a progressively lower bound, and lowers the bound rapidly. In this stage, it evidently outperforms the algorithm presented by Sandholm etc, which is the new made better result in this area.

联盟形成是多 Agent系统中的一个关键问题 .人们寻求能极大化联盟值的总和的联盟结构 ,但通常情况下可能的联盟结构的数目太大 ,以致不允许进行穷尽搜索而找出最优解 .给出了一个算法 ,可在最小搜索量内保证找到一个与最优解相距在一个限界内的联盟结构 .然后 ,这个任一时间算法进一步搜索 ,渐进地给出越来越低的限界 ,并急剧地降低这个限界 ,在这一阶段 ,此算法明显地优于由 Sandholm等人给出的算法 .

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关coalition structure的内容
在知识搜索中查有关coalition structure的内容
在数字搜索中查有关coalition structure的内容
在概念知识元中查有关coalition structure的内容
在学术趋势中查有关coalition structure的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社