枚舉法 的英文怎麼說

中文拼音 [méi]
枚舉法 英文
enumeration method
  • : Ⅰ名詞1 [書面語] (樹干) trunk2 [書面語] (馬鞭) horsewhip3 (古代行軍時防止士卒喧嘩的用具) gag...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  1. Method makes the type an enumerable type and allows using the

    的存在使得類型成為可的類型,並允許使用
  2. Unmanaged com interfaces can be enumerable objects that access enumerations through an

    訪問的可對象。
  3. Method is invoked, it returns an enumerable object that contains the powers of a number

    時,它返回一個包含數字冪的可對象。
  4. Provide methods to return enumerable collections of the properties for use at run time

    提供用於返回這些屬性的可集合的方,以便在運行時使用。
  5. Assemblies running in a partially - trusted environment will not be able to use it, even if they have the

    在部分信任的環境中運行的程序集將無使用服務器,即使這些程序集具有
  6. The thesis consists of four sections. in section one, we introduce some background of the topic, in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic - the algebraic structure of the plus cupping turing degrees, in section three, we outline the basic principles of the priority tree argument, one of the main frameworks and tools of theorem proving in computability theory, and in section four, we prove a new result concerning the algebraic structure of the plus cupping turing degrees that there exist two computably enumerable degrees a, b such that a, b ? pc, and the join a v b of a and b is high

    本篇論文分為4個部分:第一部分介紹了這個領域的一些背景知識;第二部分主要回顧了前人在研究可計算度的結構和層譜時所取得的一些基本和最新結果,這些結果與我們的主題?加杯圖靈度的代數結構密切相關;在第三部分中,我們概要的描述了優先樹方的基本原理,此方是可計算性理論中定理證明的一個重要框架和工具;第四部分證明了一個加杯圖靈度代數結構的新結果:存在兩個可計算度a , b ,滿足a , b pc ,而且a和b的並a b是一個高度。
  7. The general density function of sum of indepentent random variable of uniform distribution on [ 0, 1 ] is listed by enumerating a few special cases, where the mathematical inductive method is used

    摘要通過簡單一些特例,列出服從均勻分佈的多個獨立隨機變量和的密度函數一般公式,然後用數學歸納進行嚴格的證明。
  8. Here we describe a systematic procedure which is basically "enumeration" in nature.

    這里介紹一個本質上是屬于「枚舉法」的系統程序。
  9. According to the idea of column privoting qr method, we bring forward the greedy methods

    數值試驗表明,分而治之方枚舉法要大大節省計算時間。
  10. Several typical well - implied enumeration methods and near - implicit enumeration methods are illustrated

    了幾種典型的良性隱式枚舉法和近隱式枚舉法
  11. In general, the way to solve lrms is the enumeration method, which need more computational time

    針對這樣一個問題,人們一般採用的是,但是枚舉法是一個指數時間演算
  12. In this paper, the implicit enumeration methods for mathematical programming are effectively classified : well - implied and ill - implied enumerations

    摘要對數學規劃中的枚舉法進行了有效的分類:良性隱式與病態隱式
  13. General speaking, backtracking is more efficient than enumeration in quantity, therefore efficiency in problem is very important when inputting a large amount of data

    摘要一般而言,因溯枚舉法的效率高出幾個數量級,因此,其效率問題對于輸入規模較大的問題而言至關重要。
  14. Chapter3. the kekule structures count on swnts and some fullerenes. this chapter introduces the swnt ' s mathematical model and its geometry characters in details

    本章詳細介紹了單壁碳納米管的數學模型和幾何特徵,對其上的kekule結構計數提出了直接枚舉法和kasteleyn方的可視化設計。
  15. During the research on the planning of 10kv distribution network, founds the 0 - 1 integer - planning model, and makes use of the method of cryptic enumeration for solution

    在農村電網10kv配電線路子系統規劃研究中,建立了10kv配電線路0 - 1整數規劃的數學模型,並採用隱枚舉法成功求得最優解。
  16. 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

    目前的線損分析方一般採用枚舉法或遺傳演算,但前者是一一進行嘗試,工作量大,後者為解空間內的充分搜索,尋優過程時間長。
  17. Basic concepts and relevant calculations of hexagonal systcms. the basic concepts of hexagonal systems are introduced. we also recommend two calculating methods for the kekule structure count on hexagonal systems f enumeration and formula applying

    介紹了六角系統的基礎知識,包括六角系統的基本概念和性質,以及計算平面六角系統中kekule結構數的兩種方枚舉法和公式
  18. A permutated implicit enumeration for the linear 0 - 1 programming model is proposed according to the generic model in this thesis, which utilizes the relationship between the objective functions, permutes the constrained solutions so as to search the optimum solution in the aggregate of minimums and accelerate the convergence speed

    針對多機場的非實時流量管理的模型,提出了基於排序的隱枚舉法,它利用目標函數值大小的相對關系,對約束條件解進行排序,在最小解集中尋找最優解,以加快收斂速度。
  19. 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

    給水管網優化設計是城鎮供水工程的一項重要工作,國內外許多學者都對此做了廣泛、深入的研究,提出了很多具有代表性的優化設計理論與方,例如枚舉法、線性規劃、動態規劃,還有遺傳演算和模擬退火演算等。
  20. 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方,它們可以處理任意螺旋度的單壁碳納米管。
分享友人