نتایج جستجو برای: lin
تعداد نتایج: 11149 فیلتر نتایج به سال:
Helsgaun has introduced and implemented the lower tolerances (α-values) for an approximation of Held-Karp’s 1-tree with the purpose to improve the Lin-Kernighan’s Heuristic (LKH) for the Symmetric TSP (STSP). The LKH appears to exceed the performance of all STSP heuristic algorithms proposed to date. In this paper we improve the Helsgaun’s LKH based on an approximation of Zhang and Looks’ backb...
KEY: # = new course * = course changed † = course dropped University of Kentucky 2015-2016 Undergraduate Bulletin 1 LIN 209 THE STRUCTURE AND USE OF ENGLISH. (3) A general survey of the history, structure, and use of the English language. Topics investigated include: the history of the English language; elements of the structure of English; the distinctive characteristics of spoken and written ...
Multi-trial Lin-Kernighan-Helsgaun 2 (LKH-2) is widely considered to be the best Interated Local Search heuristic for the Traveling Salesman Problem (TSP) and has found the best-known solutions to a large number of benchmark problems. Although LKH-2 performs exceptionally well on most instances, it is known to have difficulty on clustered instances of the TSP. Generalized Partition Crossover (G...
In recent years, several heuristics have been proposed for the hardware/software partitioning problem. One of the most promising directions is the adaptation of the Kernighan-Lin algorithm. The Kernighan-Lin heuristic was originally developed for circuit partitioning, but it has been adapted to other domains as well. Moreover, numerous improvements have been suggested so that now several varian...
The purpose of this paper is to deal with some uniqueness problems of entire functions or meromorphic functions concerning differential polynomials that share one value or fixedpoints with finite weight. We obtain a number of theorems which generalize some results due to M.L. Fang & X.H. Hua, X.Y. Zhang & W.C. Lin, X.Y. Zhang & J.F. Chen and W.C. Lin.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید