heuristic programming 中文意思是什麼
heuristic programming
解釋
啟發式程序設計- heuristic : n. -s 1. 啟發式教學法，啟發式的藝術[應用]。2. 【計算機】直觀推斷，試探法。adv. -ally
- programming : 編程序的
-
In view of the refinery practice, mathematical programming technique is used to construct the scheduling model, heuristic rules are applied to reduce the constraints and variables number in order to simplify the problem
根據煉油行業的實際情況，用數學規劃方法建立各個功能模塊的調度模型，運用啟發式規則降低約束和變量的個數，從而降低問題的復雜性，是本文採用的一個主要方法。 -
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 ）這兩種方法考慮了不同類型資源的稀缺性，並且不會影響工程的完工。 -
According to various modem heuristic approach, this paper analyzes the network correspondence programming method
摘要基於各種現代啟發式演算法，對目前網路通信規劃方法進行了相關分析和研究。 -
It introduces thoughts and steps of heuristic approach applied to network programming, and makes conclusion according to characteristics
全面介紹了通信網路中應用於網架規劃中的啟發式演算法的思想、步驟，並就各自特點做出對比總結。 -
A new reactive power optimized evolutionary programming algorithm has been proposed through the heuristic experiences of reactive power optimized voltage regulation and adaptive evolutionary programming algorithm
結合上述電壓無功調整的啟發式經驗和一種自適應進化規劃演算法，論文提出了一種新穎的具有可行方向的無功優化進化規劃演算法。 -
Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed
為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。 -
A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique
摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。 -
Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years. others are heuristic methods like genetic algorithm
近年來求解選址模型用得較多的數學優化方法有分支定界法、混合整數規劃法、運輸模型法、可分離線性規劃法。 -
An especial mode has been adopted to realize this system, which is different from the conventional mode of realizing expert system. it includes the two aspects : one is using modern database technology to organizing the repository of ipdaes and other aiding databases in order to realize sharing data ; the other is using advanced programming language with the character of object - oriented to realize the inference engine of ipdaes, which absorbs the heuristic merits of windows " helping systems to make the reasoning process easily understood by the means of including the explaining module into the inference engine
系統採用了與傳統專家系統實現不同的方式：以數據庫的形式實現知識庫，將知識庫與其他輔助數據庫融合在一起，方便數據共享和傳遞；面向對象高級語言與數據庫管理系統相結合以實現推理機制，借鑒windows標準幫助系統啟發式幫助用戶一步一步地尋找故障原因的優點，將解釋功能蘊含于推理求解的過程中，使之趨於人性化，推理過程更清晰，更易理解和使用。 -
Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically. this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do. an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength. test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調整布局方案的要求.與以前的以單元為中心的演算法不同，演算法基於單元行劃分來進行單元的插入和位置調整，在此過程中使對原布局方案的影響最小，並且盡可能優化線長.一組從美國工業界的測試例子表明，該演算法運行速度快，調整后的布局效果好 -
Firstly, the system r style dynamic programming procedure ( and the specific heuristic rule ) is used to determine the join order of the relations. after that, the expensive predicates are placed in the operator tree ( or execution plan ) according their rank values with respect to joins
它首先利用systemr中的動態規劃優化演算法和啟發式規則為連接運算產生連接次序，在此基礎上，根據選擇條件的rank值，將它放置到執行規劃中的適當位置。 -
In this paper, first, i present a new model of vrp and a heuristic algorithm of it. then, i have proofed that on the distance constrained vrp, any polynomial time heuristic h for mv, we have kh / kv > 2 ; and i give a dynamic programming recursion heuristic of md. furthermore, i study some stochastic vehicle routing problem also
並證明了在距離約束的vrp情形下對于目標函數mv （車輛數最小） ，其任一有多項式時間的啟發式演算法h得到的車輛數目k ~ h和最優車輛數目k ~ v滿足關系k ~ h k ~ v 2 ，我們還給出了md （總距離最小）的一個動態規劃演算法。 -
Thus, according to mechanics of dealing with stochastic phenomena in programming theory, multi - objective stochastic programming model is developed to dispose parameter uncertainty. as a heuristic monte carlo approach with powerful global searching, genetic algorithm based on stochastic programming is utilized
為了更好的處理實際生產中參數的不確定性，根據數學規劃論中處理隨機現象的機理，建立多目標隨機規劃模型，模型求解採用基於隨機規劃的遺傳演算法。 -
In this paper, by using cost functions of flights, a model is presented to schedule aircraft landings, which satisfies the landing intervals and separation constraints, and puts forward a heuristic algorithm by using local search and linear programming
利用航班的成本函數，建立了滿足著陸間隔、著陸時間段等約束的著陸規劃模型，提出了一種使用局部搜索和線性規劃的啟發式演算法。 -
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
本文針對目前對接入網優化存在著缺乏有效演算法的現狀，確定了採用高效的啟發式搜索演算法? ?遺傳演算法作為優化演算法，著重解決了遺傳運算元的設計和實現問題，並對演算法進行了改進，取得了很好的效果。 -
The research in this paper offers a new way to design programming icai platform and help to extend and apply par method. innovation and characteristic of the platform as follows : 1, focus on programming theory and improvement of the learner ' s programming ability 2, enable heuristic teaching, teach learners in accordance of their aptitude 3, introduce algorithm with the help of simulation based on java mud - thread 4, learners can get the outcome of program using auto program transform software, such as apla - c + +, apia - java 5, easiness to extend and migrate and to transform to network based icai platform
文中實現的教學軟體平臺的創新點與特色主要有： 1 、以程序設計理論和方法學為主要內容，注重學員程序設計能力的培養， 2 、結合學習理論，對教學內容進行啟發式教學，針對不同能力的學生做到「因材施教」 ； 3 、具有java多線程的模擬演示功能，形象地介紹演算法原理， 4 、實現了與apla - c + +等程序自動轉化器的銜接，學員可立即得到執行結果， 5 、軟體可擴充性、可移植性強，易於轉化為網路化教學平臺。
分享友人