枚舉演算法 的英文怎麼說

中文拼音 [méiyǎnsuàn]
枚舉演算法 英文
enumeration algorithms
  • : Ⅰ名詞1 [書面語] (樹干) trunk2 [書面語] (馬鞭) horsewhip3 (古代行軍時防止士卒喧嘩的用具) gag...
  • : 動詞1 (演變; 演化) develop; evolve 2 (發揮) deduce; elaborate 3 (依照程式練習或計算) drill;...
  • : Ⅰ動詞1 (計算數目) calculate; reckon; compute; figure 2 (計算進去) include; count 3 (謀劃;計...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  1. In general, the way to solve lrms is the enumeration method, which need more computational time

    針對這樣一個問題,人們一般採用的是,但是是一個指數時間
  2. Generally the present analyzing ways adopted are enumerating or genetic algorithm. the former tests all, which needs much work, while the latter is the complete ferret for space of resolution, which will take much time in finding the optimal

    目前的線損分析方一般採用或遺傳,但前者是一一進行嘗試,工作量大,後者為解空間內的充分搜索,尋優過程時間長。
  3. Firstly, we propose a framework of selecting xml views for caching, including algorithms of enumerating frequent query sub - patterns, computing frequency of query sub - patterns and selection of materialized views for caching

    第一,我們提出一套選擇實體化視圖進行緩存的基本方,包括頻繁查詢子模式的枚舉演算法、查詢模式頻度的計和選擇實體化視圖裝入緩存的
  4. Lfc is yet another functional programming language which has many characteristics, such as good mathematics basis, reference transparency, no side effect, pattern matching, etc. in theory, an algorithm of enumerating sentences of cfg is presented

    本文工作主要是研究形式規約語言lfc的實現和應用,另外還包括一個上下文無關語言句子枚舉演算法。在理論方面,提出了一個上下文無關語言句子枚舉演算法
  5. This paper presents an efficient optimization algorithm and complicated code for airciraft landing scheduling problem, based on depth - first - search implicit emumeration algorithm, subject to mps limiting, position lock limiting and optimization depth limiting

    摘要以深度優先搜索的隱枚舉演算法為基礎,結合mps約束、位置凍結限制、優化深度限制,使用復雜的軟體編碼實現了特定於飛機著陸調度問題的優化排序
  6. First, the minimal and maximal sentences of cfg are calculated. then the character strings are scanned one by one from the minimal sentence in certain order till the maximal sentence. the scanned character strings are printed or skipped according to a rule

    枚舉演算法首先計上下文無關語言的最小序句子和最大序句子,然後從最小序句子開始按照一定的順序掃描字元串,直至掃描到最大序句子為止,對被掃描的字元串進行判斷取捨。
  7. Using method of oil - flow visualization techniques and measuring pressure distribution along airfoil chordwise and spanwise studies have been down for sidewall boundary - layer displacement effect in two - dimensional wind tunnel. three different chord models were tested in two different wind tunnel. in order to clarify the sidewall effects and study method of sidewall suction theory and sidewall interference correction method to remove effects of sidewall on model. the results of oil - flow test show that selection rational suction wary can obtain better testing results. by investigations on effects of the sidewall boundary layer suction and application of a sidewall interference correction method

    為了很好地解決多機場航班隊列的擁塞問題,在將進場容量、離場容量與機場容量作為統一整體的情況下,充分考慮了機場間的網路效應,詳細研究了多機場航班隊列的優化問題,建立了多機場開放式非實時流量管理的數學模型,通過選取適當的決策變量,使其為線性0 - 1整數規劃模型,實現了中心流量集中管理.與其它不同,本文提出的啟發式隱枚舉演算法能很好地解決此類問題,對某機場網路系統的模擬結果證明了所建模型、優化及相應軟體的有效性和可靠性
  8. The optimal design of water supply networks is an important task of town water supply engineering. it has been broadly and deeply studied by many domestic and foreign scholars and many representative optimal theories and design methods have been advanced such as enumerating method, liner programming method, dynamic programming method, genetic algorithms ( ga ) and simulated annealing ( sa ) and so on

    給水管網優化設計是城鎮供水工程的一項重要工作,國內外許多學者都對此做了廣泛、深入的研究,提出了很多具有代表性的優化設計理論與方,例如、線性規劃、動態規劃,還有遺傳和模擬退火等。
  9. The excellence and disadvantage of them are analyzed. 2. the grset ( generate rules by using set - enumeration tree ) algorithm is proposed based on the research of predecessor

    Grset採用的是集合樹的數據結構,採用深度優先的方遞歸地生成關聯規則的後件。
  10. In the light of the conception of non - inferior result, optimum algorithm utilizes enumeration method and direct method, according to important and variable degrees of various objective function, the principle of selecting the optimum result is put forward

    尋優運用直接求非劣解的概念,借用和直接方進行尋優,提出了根據各目標函數的重要程度及變化程度選擇最優解的原則。
  11. Based on some existing theoretical results in graph theory and organic chemistry, and with the help of modern software techniques, we have developed some algorithms and a software package for the counting of kekule structures on swnt ( single - wailed carbon nanotube ), via enumeration or the kasteleyn a1gorithm. they can deal with any helical swnts

    本文以圖論與有機化學中相關的現有理論研究結果為基礎,結合現代軟體技術,將單壁碳納米管上的kekule結構計數轉化為可直接在計機上實現的和kasteleyn方,它們可以處理任意螺旋度的單壁碳納米管。
分享友人