coalition formation 中文意思是什麼
coalition formation
解釋
結盟-
To explore the formation mechanism of innovative coalition stability and prevent abortion of innovative partners, the one - to - one dynamic matching model of innovative coalitions was presented based on the analysis of dynamic and external characteristics of firm - research institute innovation coalitions with the assumption that innovative coalitions were formed through admissive negotiation rules
摘要為了探索創新聯盟穩定形成機理，解決創新伴關系的早夭問題，假設參與者通過認可的談判規則形成創新聯盟，在分析由企業和研究機構所形成聯盟的動態特徵和外部特徵的基礎上，提出創新聯盟的一對一動態匹配模型。 -
Customer coalition formation planning for combinatorial trading electronic commerce
組合貿易電子商務中的一種聯盟規劃方法研究 -
Contraposing the shortage of these methods and the complexity of coalition formation problem, we use genetic algorithm ( ga ) to realize agents ? coalition formation
針對這些演算法的不足以及聯盟形成問題的復雜性，我們提出了用遺傳演算法來實現agents聯盟的形成。 -
To perform simple and indivisible tasks, agents only need to form a single coalition and a ga - based single coalition formation algorithm is introduced in this paper
對于較為簡單的不可分割的任務， agents只要形成一個合適的聯盟，文中提出了基於遺傳演算法的單個聯盟形成演算法。 -
We use genetic algorithm ( ga ) to realize agents " coalition formation. ga can reduce the cost of searching the optimal solution or quasi - optimal solution, and enhance the efficiency of the whole system
本文使用遺傳演算法來實現機器人聯盟形成，遺傳演算法能夠減少尋找最優解或可行解的開銷，從而提高整個系統的效率。 -
Then this thesis uses the improved ga to solve coalition formation problem, and the simulation result illustrates the effectiveness of ga and the feasibility of algorithm in this problem
然後採用本文提出的改進的遺傳演算法來解決mas中的聯盟形成問題，進行了模擬實驗，模擬結果進一步驗證改進遺傳演算法的優越性及其運用在聯盟結構形成問題上的可行性。 -
In the second place, to perform tasks, robots must form coalition when a single robot cannot perform tasks and tasks cannot be partitioned, or the partition is computationally too complex. coalition formation in mas ( multi - agent system ) is addressed to solve robots coalition formation in muti - robots
當單個機器人不能完成任務，且任務不能分解或分解演算法很復雜時，可以應用mas （ multi - agentsystem ）的聯盟形成方法解決多機器人的分組協作執行任務。 -
Then, a new intermediary - driven combinatorial electronic market model is presented. customer coalition formation in these marketplaces is studied. second, from the reversed view of above research, at the microscopic level, planning ability of deliberative buyers ’ agents is considered
在提出一種新的多agent中介系統主導的組合市場模型imascm模型的基礎上，首先介紹了一種組合貿易中適用的計劃表示方法，然後研究了消費者組合購買問題的自動規劃過程。 -
The core of this thesis is a model of multi - agent cooperation, named toac ( task oriented acquaintance coalition ). this thesis defines task domains, coalition, agent acquaintance relation, social organization and trust degree of acquaintance coalition mechanism in toac ; analyzes coalition formation and convention of toac ; analyzes task allocation and execution approach ; finally gives the result of simulation experiment and compare of different cooperative model
核心部分是提出了一種多agent協同模型? ?面向任務的熟人聯盟（ toac ） ，對toac中的任務領域、 agent熟人聯盟、 agent社會規律、 agent熟人關系、社會組織形式、信任度進行了定義和描述，對聯盟的形成和協同行動進行了形式化描述，分析了toac中聯盟形成和行為規范機制，對聯盟的任務分配和執行的具體步驟進行了詳細形式化分析，進行了比較和模擬試驗。 -
A plan representation for combinatorial trading is presented. then, automated planning process mixed with coalition formation process is studied, which consists of demand propagation, coalition formation for single article and overpay transmit. feasible purchasing plans are derived from the coalition planning algorithm for customers
本文將聯盟過程看作規劃過程的一環，通過單商品交易聯盟形成、需求傳播和剩餘支付轉移三個相繼循環執行的過程形成整個聯盟規劃過程，為消費者生成包含聯盟結果的購買計劃。 -
In addition, this thesis analyzes the present correlated work of the coalition formation problem in mas, presents the shortcomings of these work, and presents a coalition formation method considering some main factors : task decomposing, attributes of agents, dependent relations among agents
針對多agent系統協作理論中的聯盟結構形成問題，對已有的相關的工作做了分析和討論，指出其中的缺陷，本文的聯盟結構的形成方法主要考慮的因素是根據系統中任務分解、多agent間的依賴關系和各個agent自身的性質屬性情況。 -
The paper describes two type robot formation problems ( single task coalition and sequence tasks coalition structure ), and gives them corresponding mathematic models
本文對機器人聯盟問題的兩種類型（單任務聯盟和任務序列的聯盟結構）進行了描述，並給出了數學模型。 -
To perform divisible tasks and sub - tasks have no precedence order, agents need to form several coalitions ( coalition structure ) and a ga - based coalition structure formation algorithm is introduced in this paper
對于可分解的任務，並且子任務之間沒有優先關系， agents要形成多個聯盟（聯盟結構） ，文中提出基於遺傳演算法的聯盟結構形成演算法。 -
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聯盟問題分為兩種類型，並為這兩種問題建立了數學模型。 -
Just like other optimization problems, coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space. if algorithm traverses the whole search space, search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time
與其它的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索組合爆炸，在多項式時間內無法完成搜索。 -
Just like other optimization problem, coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space. if algorithm traverses the whole search space, search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time
與其他的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間中尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索的組合爆炸，在多項式時間內無法完成搜索。 -
Electronic commerce has attracted much attention for it offers significant opportunities to make businesses faster, cheaper, and more agile. however these days, it is facing severe challenge because it cannot adapt itself to users ’ expanding demand for personality and automation of businesses. this dissertation investigates the problem of combinatorial trading and applies multi - agent coalition formation methodology for it
由於具備能夠突破貿易的時空限制、降低交易的各類成本等諸多優勢，電子商務自出現至今始終備受關注，但是近年來其發展卻呈現出一定程度的震蕩和萎縮，而目前電子商務研究的理論及應用不能適應商務活動中用戶日益個性化和自動化的需求便是導致這種狀況的一個主要原因。 -
Aiming at the implicit parallelism of ga and the characteristic of dps system, we study the parallelization of the former two algorithms. the basic idea is to put forward an agents - based model of parallel coalition formation algorithm on the basis of coarse - grained parallel genetic algorithm
由於遺傳演算法的隱并行性以及dps系統的特性，我們在文中對上述兩種演算法的并行化做了研究，基本的思想是在粗粒度并行遺傳演算法模型的基礎上提出一種基於agents的并行聯盟形成演算法模型。
分享友人