An exhaustive conformational analysis of N -formyl- l -tyrosinamide using a genetic algorithm for multimodal search
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملAnalysis of an Exhaustive Search Algorithm in Random Graphs
Abstract. We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual Gn;p-model where each possible edge appears independently with the same probability p. The expected cost turns out to be of the less common asymptotic order n log , which we explore from several different perspectives. Also we collect many instances wh...
متن کاملAnalysis of an exhaustive search algorithm in random graphs and the nc log n-asymptotics
We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual Gn;p-model where each possible edge appears independently with the same probability p. The expected cost turns out to be of the less common asymptotic order n log , which we explore from several different perspectives. Also we collect many instances where such a...
متن کاملAnalysis of an exhaustive search algorithm in random graphs and the n log -asymptotics
We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual Gn,p-model where each possible edge appears independently with the same probability p. The expected cost turns out to be of the less common asymptotic order nc logn, which we explore from several different perspectives. Also we collect many instances where such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Chimie
سال: 2017
ISSN: 1631-0748
DOI: 10.1016/j.crci.2016.11.008