نتایج جستجو برای: bound algorithm is proposed then

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

Journal: :مدیریت صنعتی 0
سید محمود قاضی میرسعید دانشجوی کارشناسی ارشد، دانشکده مهندسی صنایع، دانشگاه خواجه نصیرالدین طوسی، تهران، ایران امیرعباس نجفی استادیار دانشکدة مهندسی صنایع، دانشگاه خواجه نصیرالدین طوسی، تهران، ایران حمید شهریاری دانشیار دانشکده مهندسی صنایع، دانشگاه خواجه نصیرالدین طوسی، تهران، ایران

one of the most important problems in the system reliability optimization is redundancy allocation problem that has been studied in different system configurations. k-out-of-n structure is a general system configuration and offers enhanced capabilities for analyzing more design problems. hence, in this paper, the redundancy allocation problem of k-out-of-n systems is studied. in the most previo...

Journal: :journal of advances in computer research 0
hasan nasiri soloklo department of electrical engineering, firoozkooh branch, islamic azad university, firoozkooh, iran malihe maghfoori farsangi electrical engineering department, shahid bahonar university of kerman, kerman, iran

in this paper, a new alternative method for order reduction of high order systems is presented based on optimization of multi objective fitness function by using harmony search algorithm. at first, step response of full order system is obtained as a vector, then, a suitable fixed structure considered for model order reduction which order of original system is bigger than fixed structure model. ...

Journal: :journal of sciences, islamic republic of iran 2012
h. mansouri

in this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (hlcps). the algorithm uses only full-newton steps which has the advantage that no line searchs are needed. moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...

فرشاد, محسن , فلقی, حمید , مویدی ‌راد, حجت ,

One of the ways of reducing active power losses in the distribution networks is using the network reconfiguration for different load levels. Since the number of possible configuration of a distribution network is usually very much and then review of all of them (especially in the network of large-scale) to finding the optimal configuration is not possible simply, therefore in this paper a new a...

Journal: :journal of medical signals and sensors 0
mahsa saffari farsani masoud reza aghabozorgi sahhaf vahid abootalebi

the aim of this paper is to improve the performance of the conventional goertzel algorithm in determining the protein codingregions in deoxyribonucleic acid (dna) sequences. first, the symbolic dna sequences are converted into numerical signals usingelectron ion interaction potential method. then by combining the modified anti-notch filter and linear predictive coding model,we proposed an effic...

2011
Kai Li Shanlin Yang

This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time. For this NP-hard problem, the largest sum of release date, processing time and delivery time first rule is designed to determine a certain machine for each job, and the largest difference between delivery time and release date first rule is ...

This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...

Journal: :journal of optimization in industrial engineering 2013
sadollah ebrahimnejad seyed meysam mousavi behnam vahdani

a shortest path problem is a practical issue in networks for real-world situations. this paper addresses the fuzzy shortest path (fsp) problem to obtain the best fuzzy path among fuzzy paths sets. for this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (ifss) in order to determine the fuzzy shortest path. moreover, this algorithm is developed for ...

Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...

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

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