نتایج جستجو برای: Multiple simulated annealing
تعداد نتایج: 894345 فیلتر نتایج به سال:
in today’s dynamic market, organizations must be adaptive to market fluctuations. in addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
An annealing time of 30-45 seconds is commonly used in PCR reactions. Increase in annealing time up o 2-3 minutes did not appreciably influence the outcome of the PCR reactions. However, as the polymerase has some reduced activity between 45 and 65 C (interval in which most annealing temperature are chosen), longer annealing times may increase the likelihood of unspecific amplification products...
A simulated annealing method is described for training hidden Markov models and producing multiple sequence alignments from initially unaligned protein or DNA sequences. Simulated annealing in turn uses a dynamic programming algorithm for correctly sampling suboptimal multiple alignments according to their probability and a Boltzmann temperature factor. The quality of simulated annealing alignm...
SUMMARY Genome-wide association studies are now technically feasible and likely to become a fundamental tool in unraveling the ultimate genetic basis of complex traits. However, new statistical and computational methods need to be developed to extract the maximum information in a realistic computing time. Here we propose a new method for multiple association analysis via simulated annealing tha...
mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...
Multiple sequence alignment has been a useful method in the study of molecular evolution and sequence-structure relationships. This paper presents a new method for multiple sequence alignment based on simulated annealing technique. Dynamic programming has been widely used to find an optimal alignment. However, dynamic programming has several limitations to obtain optimal alignment. It requires ...
هدف این پایان نامه استفاده از روش شبه آنیلکاری (simulated annealing )برای حل مساله جانمایی - تخصیص با تابع هدف مینی ماکس و فاصله اقلیدسی می باشد. شبه آنیلکاری یکی از کاراترین و قدرتمندترین الگوریتمها برای حل مسائل بهینه سازی ترکیبی با تابع هدف معلوم می باشد. در این پایان نامه یک روش شبه آنیلکاری برای حل مساله جانمایی - تخصیص با تابع هدف مینی ماکس و فاصله اقلیدسی توسعه داده شده است و عملکرد آن ب...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید