نتایج جستجو برای: farthest points
تعداد نتایج: 265937 فیلتر نتایج به سال:
and Applied Analysis 3
We propose a novel algorithm for placement of streamlines from two-dimensional steady vector or direction fields. Our method consists of placing one streamline at a time by numerical integration started the furthest away from all previously placed streamlines. Such a farthest point seeding strategy leads to high quality placements by favoring long streamlines, while retaining uniformity with th...
abstract: the present thesis includes ; one preface and 11speeches , that each speech considered in different researches . the prefact part , studied grammer back ground , the first speech considered a brief description about grammatical credits . the second speech considered the different typs of sentences , from structure and meaning points of view . the third speech considered the verb es...
in this thesis, we consider a mathematical model of cancer with completely unknown parameters. we study the stability of critical points which are biologically admissible. then we consider a control on the system and introduce situations at which solutions are attracted to critical points and so the cancer disease has auto healing. the lyapunov stability method is used for estimating the un...
Motivated by the spare parts distribution system of a major automotive manufacturer in Turkey, we consider a multicommodity distribution problem from a central depot to a number of geographically dispersed demand points. The distribution of the items is carried out by a set of identical vehicles. The demand of each demand point can be satisfied by several vehicles and a single vehicle is allowe...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds points on S and updates the 3-dimensional Delaunay triangulation of the points. The method is very simple and works in 3d-space without requiring to parameterize the surface. Taking advantage of recent results on the restricte...
In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path metrics or high-dimensional Euclidean metrics. The first of these problems is the greedy permutation (or farthest-first traversal) of a finite metric space: a permutation of the points of the s...
Information about the performance of a BTS (Base Transceiver Station) is needed to help improve Network service. But in selection good or bad it can be caused by several factors such as Transmission, Power, and Celldown BTS. Therefore we need system that provide recommendations using right method, here are decision support methods including Fuzzy Multiple Attribute Decision Making TOPSIS. The T...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید