نتایج جستجو برای: genetic algorithm and lattice map
تعداد نتایج: 17004553 فیلتر نتایج به سال:
multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...
clustering is the process of dividing a set of input data into a number of subgroups. the members of each subgroup are similar to each other but different from members of other subgroups. the genetic algorithm has enjoyed many applications in clustering data. one of these applications is the clustering of images. the problem with the earlier methods used in clustering images was in selecting in...
In this article is discussed novel method of the so-called complex networks dynamics and its visualization by means of so called coupled map lattices method. The main aim of this research is to demonstrate possibility to visualize complex network dynamics by means of the same method, that is used spatiotemporal chaos modeling. It is suggested here to use coupled map lattices system to simulate ...
به منظور یافتن روشی برای تشخیص بیماری های قلبی خوشه بندی صحیح سیگنال های الکتروکاردیوگرام امری حیاتی است. تمرکز اصلی این پایان نامه بر ارائه ی الگوریتمی با دقت بالا برای یافتن راه حلی برای خوشه بندی کمپلکس های سیگنال الکتروکاردیوگرام (ecg) هولتر است. در این پژوهش علاوه بر پایگاه داده mitbih از پایگاه داده ایجاد شده توسط گروه قلب دانشگاه خواجه نصیر نیز استفاده شده است. در مرحله اول، با استفاده...
Lifting operators play an important role in starting a kinetic Boltzmann model from given macroscopic information. The macroscopic variables need to be mapped to the distribution functions, mesoscopic variables of the Boltzmann model. A well-known numerical method for the initialization of Boltzmann models is the Constrained Runs algorithm. This algorithm is used in literature for the initializ...
Multilinear maps have become popular tools for designing cryptographic schemes since a first approximate realisation candidate was proposed by Garg, Gentry and Halevi (GGH). This construction was later improved by Langlois, Stehlé and Steinfeld who proposed GGHLite which offers smaller parameter sizes. In this work, we provide the first implementation of such approximate multilinear maps based ...
در رساله حاضر سعی بر توسعه روش های جدید مطالعات ارتباط کمی ساختار- فعالیت سه بعدی شده است. لذا در بخش اول مقدمه ای در مورد اساس روش های ساختار- فعالیت دوبعدی بیان خواهد شد و سپس شرح مختصری در مورد روش های ساختار- فعالیت سه بعدی داده و در نهایت به بیان کاربرد ی از دو روش مدل سازی ارتباط کمی ساختار- فعالیت دو بعدی و سه بعدی یعنی comfa و نیز comsia بر روی تعدادی از مشتقات 1-(3-پیریدیل کربامویل) ای...
normal 0 false false false en-us x-none fa background: regarding the importance of right diagnosis in medical applications, various methods have been exploited for processing medical images solar. the method of segmentation is used to analyze anal to miscall structures in medical imaging. objective: this study describes a new method for brain magnetic resonance image (mri) segmentation via a ...
Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. Graph coloring problem (GCP) is about finding the smallest number of colors needed to color a given graph. The smallest number of colors needed to color a graph G, is called its chromatic number. GCP is a well-known NP-hard problems and, therefore, heuristic algorithms are usually...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید