heuristic algorithm 中文意思是什麼
heuristic algorithm
解釋
試探式演算法-
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
優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化，使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面，允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展，可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差，因此，為了改善性能，提出一種啟發式方法，它發現的是近似最優的規則.在人造數據集上的實驗結果表明，當優化規則包含兩個數值屬性時，優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明，該演算法具有近似線性的可擴展性和較好的精度 -
A heuristic algorithm for flow shop problem in batch processing
成組排序問題的調度演算法設計及其界的估計 -
Study on the heuristic algorithm of unflowing job scheduling based on cpm
的非流水作業排序啟發式演算法 -
In this paper we improved the traditional sa algorithm, and the heuristic algorithm is applied to the search and move schedule. the neighborhood is changed from the fixable to the alterable, the operation of moving and rotating is alternate, and the precision of the solution is then guaranteed as well as its convergence speed
本文對傳統的sa演算法進行了改進，在演算法的搜索策略和變動策略中應用了啟發式方法，由定鄰域搜索變為變鄰域搜索，平移和旋轉變動交替進行，既保證了解的精度又提高了其收斂速度，取得了良好的布局效果。 -
Tabu search ( ts ) algorithm is a meta - heuristic algorithm
禁忌搜索演算法（ tabusearch ， ts ）是一種亞啟發式搜索演算法。 -
To better elucidate the following critical problems - - building the rational mathematics model and searching the effective algorithms, this paper sets forth the basis of algorithms and heuristic algorithm. meanwhile it compendiously introduces the main principles of genetic algorithm and the stimulated annealing algorithm, principal parameters during the course of solving problems and vertex coloring theory
為了更好地說明下文所要解決的關鍵問題? ?建立合理的數學模型和尋找有效可行的演算法，本文闡述了演算法和啟發式演算法的理論基礎，並扼要地介紹了遺傳演算法、模擬退火演算法的主要思想和在解題過程中應用的重要參數，以及圖的著色理論；及其在作業計劃編制中應用的可能性。 -
In the preprocessing stage the method of user and session identification often adopt heuristic algorithm for the being of cache and agent. this induce the uncertainty of data resource. the cppc algorithm avoid the limitation and has no use for complicated hash data structure. in this algorithm, by constructing a userld - url revelant matrix similar customer groups are discovered by measuring similarity between column vectors and relevant web pages are obtained by measuring similarity between row vectors ; frequent access paths can also be discovered by further processing of the latter. experiments show the effectiveness of the algorithm. in the fourth part, this thesis bring some key techniques of data mining into web usage mining, combine the characteristic of relation database design and implement a web usage mining system wlgms with function of visible. lt can provide the user with decision support, and has good practicability
本文演算法避免了這個缺陷，且不需要復雜的hash數據結構，通過構造一個userid - uel關聯矩陣，對列向量進行相似性分析得到相似客戶群體，對行向量進行相似性度量獲得相關web頁面，對後者再進一步處理得到頻繁訪問路徑。實驗結果表明了演算法的有效性。第四是本文將傳統數據挖掘過程中的各種關鍵技術，引入到對web使用信息的挖掘活動中，結合關系數據庫的特點設計並實現了一個具有可廣西人學頎士學位論義視化功能的web使用挖掘系統wlgms 。 -
Vsp is a typical strong np - hard problem, high effective exact algorithm is immposible to it. heuristic algorithm can resolve large - scale problem, but cannot ensure the quality of the resolution
Vsp是一個典型的np -難題，高效的精確演算法存在的可能性不大，啟發式演算法雖能快速求解大型問題，但對解的質量沒有保證。 -
Generalized discrete hopfield neural network and heuristic algorithm
廣義離散神經網路模型及啟發式演算法 -
A heuristic algorithm for an optimized dynamic user traffic assignment
動態交通分配中道路阻抗模型的研究 -
Heuristic algorithm for shortest path problem with nonlinear constraints
非線性約束最短路問題的啟發式演算法 -
A delay - constrained many - to - many multicast routing heuristic algorithm
一個快速的時延有界低代價多播路由演算法 -
Study of multi - machine scheduling problem based on heuristic algorithm
基於啟發式演算法的并行多機調度問題研究 -
The application of sa and heuristic algorithm in packing problem is studied deeply. an improved sa, which utilizes heuristic approach in search tragedy and movement tragedy, is introduced and manifested to enhance the rate of convergence with an extent of exact solution
對sa演算法和啟發式演算法在布局問題中的應用進行了研究，為提高收斂速度同時保證一定精確度，對sa演算法進行了改進，在演算法的搜索策略和變動策略中應用了啟發式方法，縮小布局狀態空間的搜索。 -
So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. in this paper, we propose a heuristic algorithm to address this issue
值得注意的是，當前有關萬維網挖掘的工作都是基於只包含正關系的web圖模型，而忽略了負關系的存在，如公司之間的競爭關系。 -
In production planning system, the features and contents of annual production planning, monthly planning, weekly planning and day assembling planning are discussed, and heuristic algorithm is applied in resolving the model of weekly planning and day assembling planning
在生產計劃系統中，重點探討了年度生產經營計劃、月生產計劃、周生產計劃和日裝配作業計劃的特點與內容，並將啟發式方法應用於周生產計劃和日裝配作業計劃模型的求解。 -
At last, the computational results show that the heuristic algorithm has perfect scheduling performance and can be applied to domestic air traffic tactic flow management system
計算結果表明，所給模型和演算法具有良好的規劃性能，能較好地解決終端區排序問題，可應用於我國空中戰術流量管制系統。 -
The following is the detailed, 1. in the chapter 2 of constructing system modeling, first, the manufacture tasks are calculated and the process is described. then, according to the theory of constraints ( toc ), the constraint items and target function of corporation runing are defined and three rules of heuristic algorithm are described. at last, the model to arranging production plan by heuristic algorithm and the fuzzy logic model to follow the plan be carried out are constructed
在建立系統模型部分，首先，明確企業的加工任務和加工工藝；其次，採用toc理論確定企業生產的約束條件，確定企業運行的目標函數，建立啟發式搜索編排的3大規則；最後，建立啟發式搜索編排生產計劃的模型，和生產計劃執行情況的模糊跟蹤模型。 -
A mathematical model is firstly proposed. then the greedy heuristic algorithm is applied to solve the model
首先建立此問題的數學模型，並採用啟發式貪心演算法對模型進行求解。 -
Considering the np - complete problem, how to get the approximate optimized scheme of job - shop scheduling, and aimed at improving the efficiency of products and taking good advantage of concurrence, asynchronism, distributing and juxtaposition in multi - products and devices processing, we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop, that is the working procedures are divided into two types, then the bf and the ff methods about memory scheduling in os are applied, therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling. namely, the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it. the results we analyzing and tested show that it is better than the heuristic algorithm common used, for less restriction terms, more satisfying algorithm complexity and better optimized results
針對job - shop調度問題求最優解演算法這一npc問題，本文以充分發揮多產品、多設備加工所具有並發性、異步性、分佈性和并行性的加工優勢，從而提高產品的加工效率為目標，對job - shop調度問題的工藝圖進行適當分解，使工序在一定時間段或是為具有唯一緊前、緊后相關工序或是為獨立工序，即將工序分兩類，再結合操作系統中內存調度的最佳適應（ bf ）調度方法和首次適應（ ff ）調度方法的先進思想，通過分析提出了一種解決一般job - shop調度問題的全新近優解方案：在考慮關鍵設備上工序盡量緊湊的前提下，將工序分類、對這兩類工序分批採用擬關鍵路徑法（ acpm ）和最佳適應調度方法（ bfsm ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。
分享友人