您要查找的是不是:
- The paper offers polynomial time algorithm of the functional all-terminal reliability of cordal ring. 給出了弦環的實用全終端可靠度的一種計算方法;此方法是多項式時間的.
- Theorem 4.1 Algorithm 4 can solve the problem (P) by using at most 2k-1 matchings in polynomial time. 定理4.;1 演算法4能夠在多項式時間內給出問題(P)的一個用2k-1次匹配的解。
- Finally, a polynomial time algorithm for solving an optimal cover of FD set is given. 最後給出了一個求FD集最優覆蓋的多項式時間演算法。
- But the language constructed there is indeed an unnatural one because the construction needs to run all polynomial time Turing machines. 但 Lander給出語言並不是一個自然的語言因在該語言的構造中需運行所有多項式時間的圖靈機 .
- It is impossible to tackle all combinatorial optimization problems (COP) in deterministic polynomial time with accurate solution. 由於組合優化問題的解空間十分龐大,使用精確求解方法無法在確定多項式時間內求得它的最優解。
- Yet, it cannot be expected that an algorithm can find, in polynomial time, a solution to an arbitrary GCP instance, because the GCP is NP-hard. 由於對於任意一個圖著色例子而言,沒有一種演算法可以在多項式的時間內找到它的解,因此圖的著色問題是一個NP難的問題。
- Meantime,the polynomial time algorithm is suggested.The method provides a new way for the bilevel decision problem and multi-level decision making. 同時,在上下層問題獨立求解時,引入了一種多項式的時間演算法,為兩層以及多層決策問題提供了新的求解途徑。
- The second algorithm takes polynomial time in the size of input.This algorithm effectively finds a minimum cover for FDs propagated from XML keys. 第二個演算法需要花費輸入集合的多項式時間倍,此演算法有效地計算來自XML關鍵字的函數依賴最小覆蓋的演算法。
- It's commonly believed that no polynomial time algorithms exist for such formula satisfiability problems,since they belong to the NPC class. 布爾表達式的判定是NPC問題,用回溯法就能解決這一問題(只要變數不是很多)。
- The computing speed meets the requirement for r eal time computation. 結果表明 ;該方法對複雜目標激光雷達散射截面的計算速度基本達到了實時計算要求 .
- FVM has high accuracy due to avoiding the rezoning.But FVM needs a long time computation. FVM避免了網格再劃分問題,模擬精度高,但計算時間長。
- In this paper, we study the undirected minimum-cardinality feedback vertex set problem in outer-planar graphs and present a polynomial time algorithm to solve it. 本文討論外平面圖的反饋點集並給出了一個求外平面圖最小反饋點集的多項式時間演算法。
- Devise a genetic algorithm to solve the Economic Lot and Delivery Scheduling Problem-ELDSP, and compared with heuristic algorithm and polynomial time algorithm. 設計了基於經濟批量與交貨期問題(ELDSP)的遺傳演算法。
- The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system. 內點法是一種求解線性規劃問題的多項式時間演算法,其顯著特徵是其迭代次數與系統規模關係不大。
- To this day, researchers have found only a few other quantum algorithms that appear to provide a speedup from exponential to polynomial time for a problem. 到目前為止,研究人員只找到少數的量子演演算法,可以將一個問題的計算所需時間,由指數時間降到多項式時間。
- AKS algorithm was proposed by three computer scientists in India in Aug 2002.This algorithm can unconditionally determine whether an input number is a prime in polynomial time. AKS演算法是3位印度的計算機科學家於2002年8月提出的;它是一個能在輸入規模的多項式時間內確定的對一個數進行素性測試的方法.
- Taking the maximum lateness as objective function, this paper develops a polynomial time algorithms for the processing sequence of the n jobs given or not given. 文中以工件的最大遲後為目標函數,對工件加工順序預先給定和可任意時的最優分批分別給出了多項式時間演算法。
- A method of time computation in degressive speed zone under steady condition with the data gained from experiment is described. 以實驗數據為基礎,提出在降速乾燥段實驗測出臨界含水量和兩個不同時刻的含水量的條件下,確定乾燥時間的一種計算方法。
- Luebke and Provan proved that the Euclidean 2-connected Steiner network problem is NP-hard, which means that there are few possibilities of existing a polynomial time algorithm for a general finite set P of points in the Euclidean plane. Luebke和Provan證明了歐幾里德2-連通Steiner網路問題是NP-困難的。 這意味著對一般的平面有限點集而言,不大可能存在求解這個問題的多項式時間演算法。
- Based on the above results, an approximate fast algorithm is obtained for the decision problem of DNF validity. Using this algorithm, most DNF validity problems can be solved in polynomial time. 基於所得結果,對於析取範式永真性判定問題得出了一個近似快速的求解演算法,按此演算法,對絕大多數的析取範式,其永真性問題,在多項式時間內都可解決。