assignment n. 1.分給,分配。 2.指定,委派。 3.(理由等的)陳述;(錯誤等的)指出。 4.(財產(chǎn)、權(quán)利的)轉(zhuǎn)讓,讓與。 5.讓與證書,委托證書。 6.〔美國〕任命;任務(wù),工作;(課外)作業(yè)。 give students assignments 給學(xué)生留作業(yè)。 He left for his assignment in the Middle East. 他去中東赴任。
problem n. 1.問題,課題;疑難問題;令人困惑的情況。 2.【數(shù)、物】習(xí)題;作圖題。 3.(象棋的)布局問題。 the problem of unemployment 失業(yè)問題。 His whole conduct is a problem to me. 他的一切行為我都不理解。 adj. 1.成問題的;難處理的。 2.關(guān)于社會問題的。 a problem child 【心理學(xué)】問題兒童;難管教的孩子。 a problem novel [play] (反映社會問題等的)問題小說[戲劇]。 sleep on [upon, over] a problem 把問題留到第二天解決。
As one of the latter algorithms , ant colony algorithm has been used to many fields , such as : traveling salesman problem , quadratic assignment problem , network routing and load - balancing problem , vlsi design , etc 摘要蟻群算法作為一種較新的進(jìn)化類方法,目前已經(jīng)在若干領(lǐng)域取得了成功的應(yīng)用,諸如:旅行商問題、二次分配問題、通訊網(wǎng)絡(luò)中的路由問題以及負(fù)載平衡問題、大規(guī)模集成電路設(shè)計等。
By this algorithm , the optimal solution can been obtained in transportation problem n assignment problem , traveling salesman problenu flow shop sequencing problems hamilton problem . in addition , numerical examples have been given to demonstrate the actual applicant procedure 并且通過對排序問題、貨郎擔(dān)貨問題、指派問題、 hamilton問題等線形規(guī)劃問題典型算例的求解,表明新的分配原則在一定程度上簡化了原有的分配過程,具有更強(qiáng)的通用性。
An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage . in the algorithm , the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance . first , the nets are arranged into different priority queues according to their weighted sum of their length and criticality . then , the cpa problem for one queue of nets is translated into a linear assignment problem . after the assignment of one queue of nets , a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned . the algorithm is tested by a set of bench mark examples , and the experimental results are promising 提出了一種在過點分配階段解決噪聲耦合效應(yīng)問題的算法.該算法采用優(yōu)先隊列同拆線重布策略相結(jié)合的方法,控制由互連線耦合電容引起的串?dāng)_噪聲.算法中,首先按照線長和約束限制,將線網(wǎng)劃分到若干個優(yōu)先隊列中.然后,將每個優(yōu)先隊列的過點分配問題轉(zhuǎn)換為線性分配問題.在完成一個線網(wǎng)隊列的分配后,通過過點分配后處理過程檢查串?dāng)_約束滿足情況,對違反約束的線網(wǎng)對進(jìn)行拆除,放入后續(xù)線網(wǎng)隊列進(jìn)行重新分配.實驗數(shù)據(jù)表明,該算法能夠取得好的效果
We have found that many application of linear programming , such as assignment problem . , traveling salesman problem , flow shop sequencing problem , hamilton problem and so on , fall into the category of transportation problem , that is , of shipping at minimum total cost a homogeneous good from a set of m warehouses to a set of n markets 元素判別值分配法是基于運(yùn)輸問題引發(fā)出的通用解法,通過遍歷調(diào)運(yùn)表中的各行各列計算出每個元素的分配優(yōu)先權(quán)重? ?元素判別值,然后依據(jù)元素判別值,根據(jù)調(diào)配原則進(jìn)行元素分配,使得分配方案在多數(shù)情況下一次分配即可獲得最優(yōu)解,但目前仍需要完善。
Dynamic assignment problem in a large cellular system can be formulated as an dynamic programming problem , by using java programming to simulate the rl arithmetic and fixed channel assignment , and comparing the blocking probability of them with the conditions of changing the cell configurations and parameters 把一個龐大蜂窩系統(tǒng)中的動態(tài)信道分配問題公式化為動態(tài)編程問題,采用java程序設(shè)計對動態(tài)信道分配的rl算法與固定信道分配算法進(jìn)行仿真,在改變小區(qū)配置和不同參數(shù)設(shè)置的情況下比較了兩種信道分配方案的新建通話阻塞率。
In terms of analysis of collaboration planning process among multi - project , ecnp - based coordination model and coordination process model for collaboration production planning are proposed to combine the controlled coordination with the free coordination for meeting the demand of multi - project production . ecnp based coordination mechanism is developed . through bidding mechanism and coordination between task manager and bidder , an assigning method based multi - agent coordination is proposed for assigning tasks in multi - project environments . task assignment problem model 、 bidding coordination mechanism and coordination algorithm are studied . external collaboration planning model is developed and adopt genetic algorithm to solve optimization of external collaboration planning 分析多型號之間的協(xié)作規(guī)劃過程,提出多型號協(xié)作規(guī)劃的協(xié)調(diào)模型和協(xié)調(diào)過程模型,將主控協(xié)調(diào)和自主協(xié)調(diào)有效地結(jié)合起來,滿足了多型號并存生產(chǎn)的要求;建立基于ecnp的協(xié)調(diào)機(jī)制;提出基于多agent協(xié)調(diào)的多型號任務(wù)分配方法,采用招/投標(biāo)的形式,通過任務(wù)的管理者與執(zhí)行者之間的協(xié)調(diào)實現(xiàn)多型號任務(wù)分配,并對任務(wù)分配問題模型、招/投標(biāo)協(xié)調(diào)策略及協(xié)調(diào)算法等展開探討和研究,給出了在多型號并存環(huán)境下,在信息不完全的條件下進(jìn)行任務(wù)分配的有效方法;建立了外部協(xié)作計劃模型,并運(yùn)用遺傳算法優(yōu)化外部協(xié)作計劃的生成。
( 5 ) using " pruning " algorithm , we give the assignment process of returns and targets in an example of passive multisensor multitarget tracking and give two examples of cost to resource assignment problem . the analysis results show that the " pruning " algorithm has good real time ability for multi - dimension assignment problem 應(yīng)用“剪枝”法對多站被動式多目標(biāo)跟蹤的多站回波與目標(biāo)配對的分配過程,西北工業(yè)大學(xué)博l一學(xué)位論文以及兩個關(guān)于成本資源分配算例進(jìn)行了求解,并對“剪枝”法的應(yīng)用進(jìn)行了對比研究,結(jié)果表明“剪枝”法對多維分配問題的求解具有良好的實時性。
In this article , the author expounds the particularity of the activities scheduling and resource assignment problem ; sets up the mathematics model of the activities scheduling and resource assignment problem according to the model of rational unified process ; puts forward the method of activities scheduling and resource assignment based on genetic algorithm 本文在闡述軟件過程中活動規(guī)劃與資源分配問題的特殊性的基礎(chǔ)上,針對基于rup ( rational統(tǒng)一過程)模式的軟件過程,建立了軟件過程中活動規(guī)劃與資源分配問題的數(shù)學(xué)模型,運(yùn)用遺傳算法的思想及整合處理對數(shù)學(xué)模型進(jìn)行求解。
Abstract : an algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage . in the algorithm , the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance . first , the nets are arranged into different priority queues according to their weighted sum of their length and criticality . then , the cpa problem for one queue of nets is translated into a linear assignment problem . after the assignment of one queue of nets , a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned . the algorithm is tested by a set of bench mark examples , and the experimental results are promising 文摘:提出了一種在過點分配階段解決噪聲耦合效應(yīng)問題的算法.該算法采用優(yōu)先隊列同拆線重布策略相結(jié)合的方法,控制由互連線耦合電容引起的串?dāng)_噪聲.算法中,首先按照線長和約束限制,將線網(wǎng)劃分到若干個優(yōu)先隊列中.然后,將每個優(yōu)先隊列的過點分配問題轉(zhuǎn)換為線性分配問題.在完成一個線網(wǎng)隊列的分配后,通過過點分配后處理過程檢查串?dāng)_約束滿足情況,對違反約束的線網(wǎng)對進(jìn)行拆除,放入后續(xù)線網(wǎng)隊列進(jìn)行重新分配.實驗數(shù)據(jù)表明,該算法能夠取得好的效果
According to several problems considered in threat assessment , there are basically two components in this process : intent assessment and capability assessment . the bayesian network models of threat identification , intent assessment , capability assessment and threat assessment are constructed . and then tabu search algorithm recommended to solve the weapon - target assignment problem is discussed 論文首先闡述了貝葉斯網(wǎng)絡(luò)的理論基礎(chǔ);然后針對威脅評估需要考慮的主要問題,將其分為意圖評估和能力評估兩個過程,在此基礎(chǔ)上,建立了威脅識別、意圖評估、能力評估和威脅評估的貝葉斯網(wǎng)絡(luò)模型,并對禁忌搜索算法用于武器-目標(biāo)分配進(jìn)行了初步探討;最后通過具體的仿真實例,驗證了所提出方法的可行性與正確性。
The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics. It consists of finding a maximum weight matching in a weighted bipartite graph.