combinatorial algorithm 中文意思是什麼
-
Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce. it can increase logistic economic benefit and realize logistic rationalization. the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism, the establishment of modem chain of command, the development of its and ec. now, the problem is not only applied to the field of auto transportation, but also to ship avigation communication electricity industry management computer application etc. the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company
對貨運車輛進行調度優化，可以提高物流經濟效益、實現物流科學化。對貨運車輛調度優化理論與方法進行系統研究是物流集約化發展、建立現代調度指揮系統、發展智能交通運輸系統和開展電子商務的基礎。目前，問題的形式已有很大發展，該問題以不僅僅局限於汽車運輸領域，在水運、航空、通訊、電力、工業管理、計算機應用等領域也有一定的應用，其演算法已用於航空乘務員輪班安排、輪船公司運送貨物經過港口與貨物安排的優化設計、交通車線路安排、生產系統中的計劃與控制等多種組合優化問題。 -
A plan representation for combinatorial trading is presented. then, automated planning process mixed with coalition formation process is studied, which consists of demand propagation, coalition formation for single article and overpay transmit. feasible purchasing plans are derived from the coalition planning algorithm for customers
本文將聯盟過程看作規劃過程的一環，通過單商品交易聯盟形成、需求傳播和剩餘支付轉移三個相繼循環執行的過程形成整個聯盟規劃過程，為消費者生成包含聯盟結果的購買計劃。 -
Dp technique is a high efficiency algorithm to solve combinatorial optimization problems by divided the multidimensional problem into multiple 1 - dimension problems. when this technique resorts to accumulate multiple frames, there are some disadvantages
動態規劃演算法是一種解決組合尋優問題的高效演算法，通過將n維問題變換為n個一維優化問題，一個一個地求解的方法，很好的提高了效率。 -
In this dissertation, a combinatorial algorithm based on the directional segmentation is proposed for the preprocessing of the fingerprint images, this combinatorial algorithm is composed of normalization, directional image computation, directional filtering ( gabor filtering ), local self - adaptive binarization, noise elimination and thinning
本文的預處理演算法包括以下步驟:規一化、方向圖計算、方向濾波（採用gabor濾波） 、局部自適應二值化、二值化去噪和細化。 -
Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm, the present of the general searching algorithm is the apparent progress for the searching technology
因為組合問題的狀態空間表示比原來的搜索求解容易的多，通用搜索演算法的提出是搜索技術的一個明顯的進步。 -
Then, lda is followed and employed for the second feature extraction in the transformed space. based on this framework, a combinatorial optimal lda ( olda ) algorithm is proposed. experiments is performed on orl face image database as well as nust603 face image database, and the experimental results indicate that olda is robust, efficient and superior to the previous lda - based methods in terms of recognition accuracy
進一步地，在該理論框架下，具體給出了處理高維、小樣本問題的組合最優的線性鑒別分析演算法，在orl標準人臉庫和nust603人臉庫上的試驗結果證實了該方法的卓越性能，在識別率方面均優于以往的同類方法。 -
Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
成組技術問題是組合優化問題，而遺傳演算法正是目前求解組合最優化的有效方法之一。 -
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完全問題，具有高度復雜性，用一般的數學方法根本無法求解，目前解決三維布局問題多為各種啟發式方法，本文在對啟發式方法進行深入探討的基礎上，採用了用於解決一般三維布局問題的模擬退火演算法作為布局系統的操作演算法。 -
Combinatorial optimization using multi - agent evolutionary algorithm
組合優化多智能體進化演算法 -
Supposed algorithm b is the concrete searching algorithm for the combinatorial problem p. the parameter of algorithm a corresponding to algorithm b is the algorithm that denotes the combinatorial problem p in the way of the state space
設b是求解組合問題p的具體搜索演算法，演算法a對應于演算法b的參數就是用狀態空間表示組合問題p的演算法。 -
The main work of the paper is summarized as followings : the algorithm is improved somewhat, the algorithm is implemented in pc by mathematica software and the effectivity is proved to by testing all the examples that have been proved by d. zeilberg and h. wilf using wz - pair method and testing many identities of the book named " combinatorial identities ", which was written by h. w. gould in 1972
本文的主要結果為：對演算法作了一定的改進；在微機上，用數學軟體mathematica實現了這種演算法；試算了d . zeilberg和h . wilf用wz對方法算過的所有例題，對h . w . gould的一本名為「 combinatorialidentities 」的書中大量恆等式也作了驗證。 -
In order to overcome the default of low efficiency in traditional auction pricing, a new method and protocol based on the genetic algorithm are proposed in internet environment, which use the single - unit combinatorial auction new method to price
摘要為了克服傳統拍賣式定價法在網際網路環境下定價效率較低的不足，提出了一種基於遺傳演算法的單件組合拍賣定價新方法，並給出了相應的定價協議。 -
The algorithm is based on the breadth - first search and optimized by ant algorithm. ants system is an artificial system based on the behavior of real ant colonies, which is often used to solve combinatorial problems, such as traveling salesman problem ( tsp ). in ant colony system ( acs ), a set of cooperating agents called ants cooperate to find good solutions to tsp
本演算法基於寬度優先並用螞蟻演算法優化，螞蟻演算法是一種基於真實蟻群的人工智慧系統，常用於解決組合優化問題，如旅行商問題（ tsp ） ，在螞蟻演算法中一組螞蟻團結合作，尋找tsp問題的最優解。 -
End, based on the imascm model and the coalition planning algorithm, correlative theories of smart document agent and web services - based tuplecenters organization are investigated. using them as agents ’ framework and communication model, architecture of the third - party platform in combinatorial markets is designed. and an experimental system is realized, which validates concepts and algorithms of above coalition planning
最後，針對電子商務的實施與應用問題，基於imascm組合市場模型，本文研究了靈巧文檔agent及基於webservices的元組中心組織技術，以此實現電子商務平臺中各類agent的結構和協作模型，設計了第三方平臺的系統結構，並且實現一個商務原型系統，驗證了聯盟規劃方法概念的正確性和演算法的有效性。 -
A novel algorithm and its convergence for a class of combinatorial optimization problems
一類組合優化問題的新解法及其收斂性 -
In addition, simulated annealing algorithm for the combinatorial optimization problem here is also given
此外，利用模擬退火演算法成功地解決了該組合優化問題。 -
Recently, genetic algorithm has been tyied to resolve variable combinatorial optimization problems, such as job scheduling problem, but but has began just now in vsp
近些年來，人們在用遺傳演算法解決現實中的各種組合優化問題上進行了探索，如在生產調度問題中的應用，但在車輛調度問題中的應用才剛剛開始。 -
The inner product of the mapping value of the original data in feature space is replaced by a kernel function, and the weights of each neuron can be initialized and updated by initializing and updating the combinatorial coefficient vector of each weight in the algorithm of ksom, so some intuitive and simple iteration formulas are obtained
該演算法以核函數代替原始數據在特徵空間中映射值的內積，並且神經元權值向量的初始化和更新都可由其組合系數向量表示，從而獲得了直觀而簡單的迭代公式。 -
The pheromone - based parameterized probabilistic model for the aco algorithm is presented as the solution construction graph that the combinatorial optimization problem can be mapped on. based on the solution construction graph, the unified framework of the aco algorithm is presented. an iterative update procedure of the solutions distribution in the problem ' s probabilistic model is proposed, that will converge to the optimal solutions with probability one, then the minimum cross - entropy pheromone update rule is proposed to approximate the iterative update procedure by minimizing the cross - entropy distance and monte - carlo sampling
基於解空間參數化概率分佈模型，首先提出了一個以概率1收斂于最優解的解空間概率分佈的迭代更新過程，然後提出了通過最小化不同分佈間的交互熵距離以及蒙特卡洛采樣來逼近此迭代過程的最小交互熵信息素更新規則，接著分別給出了弧模式以及結點模式信息素分佈模型下的最小交互熵等式。
分享友人