نتایج جستجو برای: through applying a genetic algorithm

تعداد نتایج: 13855300  

Journal: :Advances in computer science research 2023

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سمنان - دانشکده ادبیات و علوم انسانی 1393

this thesis is an evaluation of poetry of sylvia plath (1932- 1963) and forough farrokhzad (1935-1967) using feminist approach and finds the positive concepts of hope, reason and strength through feminine images in their poetry. plath and farrokhzad are from different cultures and different countries but they share the same concepts and themes in their poetry. by applying feminist theory to the...

Journal: :iranian journal of medical physics 0
zohreh dehghani bidgoli ph.d. student, biomedical engineering dept., faculty of electrical engineering, tarbiat modares university, tehran, iran. mohammad hosein miranbaygi associate professor, biomedical engineering dept., faculty of electrical engineering, tarbiat modares university, tehran, iran. rasool malekfar associate professor, physics dept., faculty of basic sciences, tarbiat modares university, tehran, iran.

introduction: raman spectroscopy, that is a spectroscopic technique based on inelastic scattering of monochromatic light, can provide valuable information about molecular vibrations, so using this technique we can study molecular changes in a sample. material and methods: in this research, 153 raman spectra obtained from normal and dried skin samples. baseline and electrical noise were eliminat...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اصفهان 1389

implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...

Journal: :iranian journal of fuzzy systems 2011
h. nezamabadi-pour s. yazdani m. m. farsangi m. neyestani

in practice, obtaining the global optimum for the economic dispatch {bf (ed)}problem with ramp rate limits and prohibited operating zones is presents difficulties. this paper presents a new andefficient method for solving the economic dispatch problem with non-smooth cost functions using afuzzy adaptive genetic algorithm (faga). the proposed algorithm  deals  with the issue ofcontrolling the ex...

Journal: :مهندسی بیوسیستم ایران 0
ایشام الزعبی دانشجوی دکتری گروه مهندسی مکانیک ماشین های کشاورزی، پردیس کشاورزی و منابع طبیعی دانشگاه تهران علی رجبی پور استاد گروه مهندسی مکانیک ماشین های کشاورزی، پردیس کشاورزی و منابع طبیعی دانشگاه تهران حجت احمدی دانشیار گروه مهندسی مکانیک ماشین های کشاورزی، پردیس کشاورزی و منابع طبیعی دانشکاه تهران فرهاد میرزایی استادیار گروه مهندسی آبیاری و آبادانی، پردیس کشاورزی و منابع طبیعی دانشگاه تهران

for a uniform distribution of water, decrease in water waste and decrease in erosion of soil, it is important that a land be prepared with proper slopes along its length as well as width. the aim of leveling is to create appropriate slopes for irrigation and drainage on the lands that were not already properly levelled and of the same time creating the level surface with a minimum transport of ...

Journal: :مهندسی صنایع 0
سیدعلی ترابی دانشگاه تهران مسعود جنابی دانشگاه صنعتی امیرکبیر

in this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. single supplier via a flexible flow line production system (ffl) produces several items and delivers them directly to an assembly facility. based on basic period (bp) strategy, a new mixed zero-one nonlinear programming model has been develope...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید