combinatorial
美 [k?m?ba?n?'t?r??l] 
英
- adj.組合
- 網(wǎng)絡(luò)組合的；組合性；組合函數(shù)
英漢解釋
例句
Peptide library is one of the important techniques of combinatorial chemistry widely used for drug discovery.
肽庫合成是藥物研究組合化學(xué)策略的重要技術(shù)之一。
A class of combinatorial optimization problems has the characteristic that problem space can be mapped into a set of permutations .
針對(duì)問題空間為全排列集合的一類組合優(yōu)化問題，提出了一種混合進(jìn)化算法。
As one of the most difficult combinatorial optimization problems, Job-shop Scheduling Problem has always been a hot issue.
作業(yè)車間調(diào)度問題作為最難的優(yōu)化組合問題之一，一直以來都是生產(chǎn)調(diào)度領(lǐng)域的研究熱點(diǎn)。
The complete combinatorial method is often used to separate the bias errors of the polygon and angle-measuring system.
全組合方法能夠把測(cè)角系統(tǒng)的角位置誤差和棱體的工作角偏差有效地分離出來。
However, combinatorial chemistry has matured over the years and has found its place in the armamentarium of drug hunters.
但是，組合化學(xué)經(jīng)這幾年已經(jīng)逐步成熟，在藥物發(fā)現(xiàn)設(shè)備領(lǐng)域建立了一席之地。
This leads to exactly the sort of combinatorial complexity Microsoft Windows administrators know as "DLL hell. "
這恰好導(dǎo)致了MicrosoftWindows管理員們稱之為“DLL地獄”的一類組合式復(fù)雜性。
I have had to leave out some beautiful and important branches of combinatorial theory.
我不得不略掉組合論中某些優(yōu)美而重要的分支。
This approach leads to a combinatorial explosion of connections between the service consumers and providers in an SOA system.
這種方法會(huì)導(dǎo)致公開SOA系統(tǒng)中服務(wù)使用者和提供者間的連接。
Combinatorial optimization is concerned with problems where the set of feasible solutions is discrete or can be reduced to a discrete one.
組合優(yōu)化問題是有關(guān)的一套可行的解決辦法是離散或可歸結(jié)為一個(gè)獨(dú)立的一個(gè)。
Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose outcome.
組合游戲是兩個(gè)人均采取最優(yōu)策略情況下，最終達(dá)到不能移動(dòng)狀態(tài)時(shí)可以分出勝負(fù)結(jié)果的游戲。
In a field called combinatorial chemistry, one subfield is called "phage display" .
在一個(gè)稱為“組合化學(xué)”的領(lǐng)域里，一個(gè)子域被稱為“噬菌體展示”。
After the primal problem being transferred into a combinatorial optimization problem, genetic algorithm (GA) is designed to solve it.
原問題轉(zhuǎn)化為組合優(yōu)化問題后，采用遺傳算法進(jìn)行求解。
A sign pattern is a generalized star sign pattern if it is combinatorial symmetric and its graph is a generalized star graph.
如果符號(hào)模式A是組合對(duì)稱的，且它的圖是一個(gè)廣義星圖，則稱A是廣義星符號(hào)模式。
Genetic algorithms (GAs )have been widely reckoned as a useful vehicle for combinatorial optimization problems including scheduling problem.
遺傳算法被證明是解決任務(wù)調(diào)度等組合問題的有效工具。
But if the cost of the value stays unchanged, the combinatorial factors of the overhead profit should be considered.
如果價(jià)值成本不變，則應(yīng)采取收益最大的要素組合。
Branch and bound algorithm is one of the fundamental techniques for solving combinatorial search problems.
分枝界限算法是組合搜索中的常用方法之一。
In a variety of the methods of identifying and proofing the combinatorial identities, Riordan array is a very effective tool.
在各種發(fā)掘和證明組合恒等式的方法中，Riordan陣是一種非常有效的工具。
As the core of airport operation, aircraft stands assignment(ASA) is known as a kind of large scale combinatorial optimization problem.
停機(jī)位分配是一類規(guī)模較大的組合優(yōu)化問題，也是民航機(jī)場(chǎng)生產(chǎn)調(diào)度的關(guān)鍵和薄弱環(huán)節(jié)。
And a heuristic evolution-enhanced genetic algorithm is presented to resolve the large-scale combinatorial optimization problem.
同時(shí)，提出一種帶啟發(fā)式知識(shí)的進(jìn)化增強(qiáng)型遺傳算法用以求解這類大規(guī)模組合優(yōu)化問題。
The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization.
蟻群超啟發(fā)式，然后介紹了在組合優(yōu)化的一般角度來看待。
It's also to cut down on the combinatorial explosion of components required for language interoperability.
這同時(shí)還有助于防止因?yàn)?/c>語言的互操作性而帶來的組件之間相互組合的問題的遍地開花。
Small molecule microarrays are being used in ultra high throughput screening of large combinatorial libraries (see microfluidics ).
小分子微輻射被用于大的組合文庫的超高度大規(guī)模篩選。
As a classical Combinatorial optimization problem, resource-constrained project scheduling problem belongs to NP-Hard puzzle in theory.
資源受限項(xiàng)目調(diào)度問題作為一類典型的組合優(yōu)化問題，理論上屬于NP難題。
The timetabling problem is one of the most difficult problems in the field of operational research and combinatorial optimization.
課程表問題是運(yùn)籌學(xué)和組合優(yōu)化中最難的問題之一。
This has the advantage of providing very direct access to the algebra and to the combinatorial topology, as well as the physical ideas.
這有提供非常直接的代數(shù)的入口方面的優(yōu)勢(shì)，和對(duì)組合的拓?fù)?/c>，以及物理想法。
However, the increasing number of measurements in practical process will lead to a combinatorial explosion of hypothetical tracks.
在實(shí)際關(guān)聯(lián)過程中，量測(cè)數(shù)量增加會(huì)導(dǎo)致假設(shè)航跡數(shù)量出現(xiàn)組合爆炸現(xiàn)象，從而產(chǎn)生大量冗余計(jì)算。
The result of CSS polymorphism is a combinatorial explosion of possibilities.
CSS多態(tài)性的結(jié)果是各種可能的組合猛增。
Steiner tree problem is a classical problem in combinatorial optimization, it has been broadly used and deeply developed in many fields.
Steiner樹問題是組合優(yōu)化中的一個(gè)經(jīng)典問題，它在很多領(lǐng)域得到了廣泛應(yīng)用和深入發(fā)展。
In the last part of this thesis, we will characterize behavioral equivalences by combinatorial games.
本文的最后一部分將使用組合游戲來刻畫行為等價(jià)關(guān)系。
Distribution network reconfiguration for loss minimization is a complex, large-scale combinatorial optimization problem.
配電網(wǎng)絡(luò)重構(gòu)是一個(gè)非常復(fù)雜的大規(guī)模組合優(yōu)化問題。
Counting Rules, Combinatorial Techniques for Evaluating Probabilities. Examples.
計(jì)數(shù)規(guī)則，估計(jì)機(jī)率的組合法。范例。
The electrical network reconfiguration of shipboard power system (SPS) is a typical nonlinear combinatorial optimization problem.
船舶電力系統(tǒng)故障重構(gòu)是一典型的非線性組合優(yōu)化問題。
It is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division).
這是一門評(píng)估算術(shù)運(yùn)算（加減乘除）組合規(guī)模的學(xué)科。
Through altering combinatorial coefficients, hybrid model can be changed into adaptive.
我們通過變化組合系數(shù)將混合模型改進(jìn)成自適應(yīng)的。
The current development of the innovative combinatorial materials approach and its applications are reviewed in this paper.
綜述了國(guó)內(nèi)外在組合材料芯片技術(shù)研究和應(yīng)用領(lǐng)域的最新進(jìn)展。
Genetic algorithm and ant colony algorithm are two evolutionary algorithms for complicated problems in combinatorial optimization.
大量實(shí)驗(yàn)結(jié)果表明，這兩種算法在解決許多組合優(yōu)化問題時(shí)都能表現(xiàn)出較好的求解能力。
It shows the effectiveness and practicability of the approach to prove algebraic identities with combinatorial analysis.
說明了用組合分析方法證明代數(shù)恒等式的有效性和實(shí)用性。
The research of the Parallel Immune Algorithm application will help to solve other combinatorial optimization problems.
并行免疫算法的應(yīng)用研究將有助于其他組合優(yōu)化問題的解決。
The landslide was finished in two very deep-seated slip periods, their combinatorial modality is telescopic.
滑坡由兩期極深層次的滑動(dòng)作用完成，兩者構(gòu)成了套疊式構(gòu)造組合形態(tài)。
Trees are the simplest combinatorial structures that arise naturally in diverse applications.
樹是結(jié)構(gòu)非常簡(jiǎn)單而應(yīng)用范圍非常廣泛的一種組合結(jié)構(gòu)。
