نتایج جستجو برای: continuous and binary genetic algorithm

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

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

Journal: :Expert Syst. Appl. 2012
Muhammad Ilyas Menhas Ling Wang Minrui Fei Hui Pan

In this paper, comparative performance analysis of various binary coded PSO algorithms on optimal PI and PID controller design for multiple inputs multiple outputs (MIMO) process is stated. Four algorithms such as modified particle swarm optimization (MPSO), discrete binary PSO (DBPSO), modified discrete binary PSO (MBPSO) and probability based binary PSO (PBPSO) are independently realized usin...

Journal: :journal of advances in computer research 0

binary decision diagram (in short bdd) is an efficient data structure which has been used widely in computer science and engineering. bdd-based attack in key stream cryptanalysis is one of the best forms of attack in its category. in this paper, we propose a new key stream attack which is based on zdd(zero-suppressed bdd). we show how a zdd-based key stream attack is more efficient in time and ...

Journal: :iranian journal of management studies 2016
hesam nazari aliyeh kazemi mohammad-hossein hashemi

this study focuses on the forecasting of energy demands of residential and commercial sectors using linear and exponential functions. the coefficients were obtained from genetic and particle swarm optimization (pso) algorithms. totally, 72 different scenarios with various inputs were investigated. consumption data in respect of residential and commercial sectors in iran were collected from the ...

Journal: :international journal of automotive engineering 0
shojaeefard talebitooti yarmohammadisatri torabi

in this paper, a method based on binary-coded genetic algorithm is proposed to explore an optimization method, for obtaining an optimal elliptical tank. this optimization method enhances the rollover threshold of a tank vehicle, especially under partial filling conditions. minimizing the overturning moment imposed on the vehicle due to c.g. height of the liquid load, lateral acceleration and ca...

Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...

Journal: :Algorithms 2022

This paper focuses on minimizing the annual operative costs in monopolar DC distribution networks with inclusion of solar photovoltaic (PV) generators while considering a planning period 20 years. problem is formulated through mixed-integer nonlinear programming (MINLP) model, which binary variables define nodes where PV must be located, and continuous are related to power flow solution optimal...

A model for missing data in mixed binary and continuous responses, which can be used on cross-sectional data, is presented. In this model response indicator for the binary response can be dependent on the continuous response. A closed form for the likelihood is found. For data with a complicated pattern of missing responses some new residuals are also proposed. The model of multiplicative heter...

Journal: :Algorithms 2016
Ibidun C. Obagbuwa Ademola P. Abidoye

The Cockroach Swarm Optimization (CSO) algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have...

Abstract: We consider a new scenario in blind speech separation problem in which the number and the features of active sources change with time in opposite to the previous methods in which all sources are active all the time. Accordingly, we propose the new DESICA algorithm for source separation which is a compound of the ICA and DESPRIT algorithms. In this algorithm, using the ICA, the separat...

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

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