您要查找的是不是：
- The performance shows that D-CURE algorithm can effectively resolve the clustering partition problem in distributed environment. 實(shí)驗證明,D-CURE算法可以很好地解決在分布式環(huán)境下的聚類(lèi)分區問(wèn)題。
- In chapter 6, the subarray partition problem for airborne phased radar is discussed in pratical engineering application background, and the STAP performance is analyzed at subarray stage. 第六章研究了實(shí)際工程中面臨的相控陣機載雷達子陣劃分問(wèn)題,并對子陣級STAP性能進(jìn)行了分析。
- An optimized partition method is proposed, which is based on the notion of basic scheduling blocks(BSB). 提出了一種基于基本調度塊 ( BSB)的并行系統優(yōu)化劃分方法。
- An Ant Colony Algorithm for Set Partition Problem 集合劃分問(wèn)題的蟻群算法
- A New Algorithm for Solving Partition Problem 一種求解劃分問(wèn)題的新算法
- Having Designed an extrude intake algorithm for the half edge graph partitioning problem, this algorithm can solve machine redundant manufacturing cell design problem. 設計了針對半邊圖劃分問(wèn)題的半邊圖擠出吸入算法,用此算法求解了機器可選制造單元成組設計問(wèn)題。
- The method begins with decomposi ng PL programs into BSB. BSBs are measured in terms of hardware cost, software c ost and communication cost. Optimized partition is finally achieved by a heurist ic algorithm. 該方法首先將 PL程序分解為 BSB,然后考察 BSB的軟硬件度量 ,最后利用啟發(fā)式方法求出優(yōu)化的軟硬件劃分方案。
- Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint. 計劃路徑可選的半邊圖劃分問(wèn)題是一類(lèi)含有多種局部約束的復雜組合優(yōu)化問(wèn)題。
- A New Pseudo-polynomial Time Algorithm for Partition Problem 解答劃分問(wèn)題的新擬多項式時(shí)間算法
- Application of Optimal Partition Method in Quantified Grade Evaluation 最優(yōu)分割法在等級成績(jì)量化評價(jià)中的應用
- Optimal Partition Application Development for Ordered Sample Cluster 有序樣品聚類(lèi)的最優(yōu)分割應用程序開(kāi)發(fā)
- IMPROVED APPROXIMATION ALGORITHM FOR GRAPH PARTITION PROBLEM 關(guān)于圖劃分問(wèn)題的改進(jìn)的近似算法
- I look at this problem from a different viewpoint. 我從不同的觀(guān)點(diǎn)來(lái)看這個(gè)問(wèn)題。
- rion able to find the optimal partition , Fuzzy Sets and Systems, vol. 128, pp. 洲，”類(lèi)神經(jīng)模糊模式在乙醇汽油引擎排放廢氣之應用”，自動(dòng)
- Particle Swarm Optimization Algorithm for Set Partition Problem 集合劃分問(wèn)題的粒子群優(yōu)化算法
- She skirted round the problem of the high cost. 她避而不談巨額費用問(wèn)題。
- It may take a long time to find a solution to the problem. 也許要花很長(cháng)時(shí)間才能找到解決這個(gè)問(wèn)題的辦法。
- In dealing with the problem he was cautious to an extreme. 他在處理這個(gè)問(wèn)題時(shí)謹慎得過(guò)分了。
- The problem is how we are to get the raw material. 問(wèn)題是我們怎樣得到原材料。
- These results prove that RGA is really a better genetic algorithm for the partitioning problems. 由此可知，RGA具有較良好的演算法結構與效能。
