نتایج جستجو برای: based search algorithm gbsa
تعداد نتایج: 3504165 فیلتر نتایج به سال:
Molecular docking computationally screens thousands to millions of organic molecules against protein structures, looking for those with complementary fits. Many approximations are made, often resulting in low "hit rates." A strategy to overcome these approximations is to rescore top-ranked docked molecules using a better but slower method. One such is afforded by molecular mechanics-generalized...
محاسبات کوانتومی یک روش جدید و کارآمد در سرعت دادن به محاسبات با استفاده از پدیده های مهمی از قبیل برهم نهی1 ، تداخل2 ، عدم موجبیت3 ، ناجایگزیدگی4 و تکثیرناپذیری5 ارائه می کند. و الگوریتم های کوانتومی ابزار کار برای این نوع محاسبات می باشند که با پیدایش محاسبات کوانتومی به عنوان زیر شاخه آن مورد توجه قرار گرفته اند که در تبدیل زمان محاسبات از نوع نمائی به چند جمله ای دارای اهمیت فراوان در محاسب...
This paper proposes a GA-based reduced search space technique (GA-RSS) for the optimal design of steel moment frames. It tries to reduce the computation time by focusing the search around the boundaries of the constraints, using a ranking-based constraint handling to enhance the efficiency of the algorithm. This attempt to reduce the search space is due to the fact that in most optimization pro...
optimization of structures for minimum weight has become important in the recent designs. in this study, a genetic optimization algorithm for weight minimization of steel frames has been used. the genetic algorithm is an optimization and search technique based on the principles of genetics and natural selection. constraints regarding material strength and serviceability are taken from “aisc cod...
one of methods of improvement of the material flow is cross docking that in is considered as a good method to reduce inventory and improve customer satisfaction. too, the vehicle routing problem is one of the important problems in distribution management and its goal is to find paths for delivering various cargos. therefore, this study was conducted in order to vehicle routing problem with cros...
augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید