heuristic optimization 中文意思是什麼
heuristic optimization
解釋
試探優化- heuristic : n. -s 1. 啟發式教學法，啟發式的藝術[應用]。2. 【計算機】直觀推斷，試探法。adv. -ally
- optimization : n. 最佳化，最優化。
-
Optimized association rules are permitted to contain uninstantiated attributes. the optimization procedure is to determine the instantiations such that some measures of the roles are maximized. this paper tries to maximize interest to find more interesting rules. on the other hand, the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence. a naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute. unfortunately, that results in a poor performance. a heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance. the experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes. the experiments with real data set show the approximate linear scalability and good accuracy of the algorithm
優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化，使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面，允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展，可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差，因此，為了改善性能，提出一種啟發式方法，它發現的是近似最優的規則.在人造數據集上的實驗結果表明，當優化規則包含兩個數值屬性時，優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明，該演算法具有近似線性的可擴展性和較好的精度 -
Through a typology of tools in project acceleration, the thesis introduces two different approaches to deal with the lack of instruments in this special case which are, to wit : an optimization approach with respect to the identity adherence of the resources, the multi - objective linear programming in whole numbers ( molip ) ; a heuristic approach with respect to the identity adherence of the resources, and the exploration modified approach by cut ( emac )
本文通過對加速工程施工方面的實用工具的探索，介紹了處理這類特殊情況時使用的兩種方法。它們是：關于資源一致性的最優化方法，多目標線性規劃（ molip ）關于資源一致性的啟發方法，截斷修正法（ emac ）這兩種方法考慮了不同類型資源的稀缺性，並且不會影響工程的完工。 -
Heuristic simulation optimization technique is adopted in this paper. a simulation optimization system of tugboat marshaling is also built in this paper, which can give reasonable configuration of tugboat team to port manager
本文利用模擬優化方法的原理，開發了一套港口拖輪配置啟發式模擬優化系統，能得出理論上最佳的拖輪配置方案，輔助港口管理者作出科學的決策。 -
The heuristic analysis, some concepts and theorems of constrained optimization are employed, e. g., linear feasible direction ( lfd ), and then the proof is first provided for the uniqueness, i. e., maximum nongaussianity is the sufficient and necessary condition to independent source recovery. moreover, based on the conclusion of the uniqueness of maximum nongaussianity, the paper also proposes an alternative but straightforward approach to the proof for the well known “ one - bit - matching ” conjecture presented in multi - unit approaches
和基於啟發性分析等傳統方法和結論比較，文中引入了線性化可行方向（ linearfeasibledirection ， lfd ）等約束優化概念和理論，首次給出了基於峭度的最大非高斯估計的唯一性證明，指出最大非高斯估計是獨立源提取的充分和必要條件。 -
Heuristic algorithms of the network resource optimization for highway construction
考慮資金時間價值因素的多資源均衡優化 -
Therefore, more challenges have arisen for query optimization in database grid than traditional distributed database. following this observation, the design of a query optimizer in dartgrid ii is presented, and a heuristic, dynamic and parallel query optimization approach to processing query in database grid is proposed. a set of semantic tools supporting relational database integration and semantic - based information browsing has also been implemented to realize the above vision
克服數據庫網格特性所帶來的困難需要為數據庫網格提供全局一致的數據表達模式各結點數據模式到全局模式之間的映射方法各結點之間負載平衡和結點動態加入和退出系統的控制策略數據庫網格查詢優化器結構設計以及一整套適合數據庫網格的查詢優化演算法。 -
An algorithm of path - based timing optimization by buffer insertion is presented. the algorithm adopts a high order model to estimate interconnect delay and a nonlinear delay model based on look - up table for gate delay estimation. and heuristic method of buffer insertion is presented to reduce delay. the algorithm is tested by industral circuit case. experimental results show that the algorithm can optimize the timing of circuit efficiently and the timing constraint is satisfied
提出了一種基於路徑的緩沖器插入時延優化演算法，演算法採用高階模型估計連線時延，用基於查表的非線性時延模型估計門延遲.在基於路徑的時延分析基礎上，提出了緩沖器插入的時延優化啟發式演算法.工業測試實例實驗表明，該演算法能夠有效地優化電路時延，滿足時延約束 -
Three - dimensional packing ( tdp ) is a combinatorial optimization and hp - complete problem and applied widely to the mechanical manufacture and traffic transportation industries. up to now there are varieties of heuristic algorithms to solve the tdp because of its high complication, we discuss the heuristic algorithm deeply in this paper and apply the simulated annealing ( sa ) algorithm to the packing system
三維布局問題屬于組合最優化問題和np完全問題，具有高度復雜性，用一般的數學方法根本無法求解，目前解決三維布局問題多為各種啟發式方法，本文在對啟發式方法進行深入探討的基礎上，採用了用於解決一般三維布局問題的模擬退火演算法作為布局系統的操作演算法。 -
Then, presents a hybrid system of mrp ii / jit to build the framework of flexible production management system. further more, researches the relative technologies of mps, mrp and sfc, presents an optimization model of stochastic mps based on bi - directional consuming forecast and heuristic algorithm
提出了mc生產環境下的mrp jit混合的生產管理系統的基本框架，並重點討論了主生產計劃、物料需求計劃和車間作業控制的相關技術。 -
It belongs to heuristic optimization methods. since loads are varying all the time, we should adjust the topology to reduce the power losses
由於系統負荷是不斷變化的，針對不同的負荷情況應該調整網路拓撲結構以達到網損最小的目的。 -
Firstly, we use the algorithm of the least cost scheduling in network plan. and a useful heuristic model described as the latest finish time model for resources scheduling is selected to solve the resource optimization, which based on investigation of heuristic methods of resource - constrained activity network
首先對網路計劃進行工期? ?費用優化，然後基於對多資源約束網路計劃的啟發式方法分析的基礎上，選擇一種簡捷實用的啟發式方法? ?最遲完成時間（ lft ）判斷法，對網路計劃進行多資源綜合協調。 -
A heuristic optimization path - finding algorithm based on dijkstra algorithm
演算法的啟發式最優路徑搜索演算法 -
Conclusively, the sma architecture is a promising way to implement high performance processor ; the continuous optimization framework smarcof can utilize dynamic execution profiles and heuristic rules to eliminate sma performance hindrance effectively. preliminary work discussed in this thesis showed encouraging performance boost potential and application compatibility of smarcof
綜合來說， sma結構是一個很有潛力的方向，而基於反饋信息的持續優化方式配合正確的啟發式優化規則能夠很好的挖掘sma結構的潛力，將體系結構優勢轉化為現實的執行性能。 -
The scheme is a three - step optimizing algorithm, its purposes are loading capacity optimization and efficiency of. operationg. with the practical loading restriction, it integrates heuristic algorithms and genetic algorithms, adopts layer loading idea and space partition and combining rule. the optimizing algorithm is composed of combination pretreatment, bottom space optimize and up space optimize. it can satisfy the loading restriction and has practicability
該方案以空間利用率的優化以及運算效率的提高為目標，根據裝載過程中的實際約束條件，採用分層裝載思想以及空間劃分合併原則，結合啟發式演算法和遺傳演算法，提出三層逐次優化策略:組合預處理優化、底層空間優化、上層空間優化。 -
To improve the efficiency of the branch and bound technique, some heuristic principles are proposed to cut those branches that may generate global optimization solution with low probability
同時，為提高分支定界法的效率，利用啟發式規則剪去產生最優解可能性很小的分支。 -
Agv ( automated guided vehicle ) optimization is a typical np problem, in the course of initial group generation, this article applied accumulator process, crossover operator based continuous insertion heuristic mode, and push - connect - exclude method. according to stacker running process and characteristics, stacker optimization was devided into two parts, the first one was shelves number optimization, the second one was travel scheduling problem. finally, this article written genetic algorithm program based on c
Agv的優化調度屬于典型的np問題，在初始群體的產生中，採用聚加過程，並建立了可行插入的條件；提出了基於連續插入啟發式的交叉運算元；採用了推?銜接?排除過程來使任務的滿意度達到最佳；針對堆垛機的運行過程，建立了數學模型，並依據其運行特點，把堆垛機的優化分為兩部分，一是針對庫位號的優化，改變傳統的庫位號排列方式，利用遺傳演算法建立起比較合理的庫位號排列順序；二是把堆垛機的運行線路簡化為旅行商問題，並做了適當的修改。 -
Ground station resource scheduling optimization model and its heuristic algorithm
衛星地面站資源調度優化模型及啟發式演算法 -
A new heuristic optimization algorithm for solving the problem was presented
提出了解決這類問題的新的啟發式優化演算法。 -
Until now, this type of combinatorial problems are usually solved by linear programming, interger programming, analytical methods, heuristic methods and so on. but these methods have many disadvantages such as. low searching efficiency, converging slowly, converging to local optimization solution easily and not converging
本文針對目前對接入網優化存在著缺乏有效演算法的現狀，確定了採用高效的啟發式搜索演算法? ?遺傳演算法作為優化演算法，著重解決了遺傳運算元的設計和實現問題，並對演算法進行了改進，取得了很好的效果。 -
Modeling tools and techniques include linear, network, discrete and nonlinear optimization, heuristic methods, sensitivity and post - optimality analysis, decomposition methods for large - scale systems, and stochastic optimization
模型建立工具和方法涵蓋線性、網路、離散和非線性最佳化，啟發式方法，靈敏度分析，事後最佳化分析，大規模系統的分解方法和隨機最佳化。
分享友人