نتایج جستجو برای: optimum determinant optimization
تعداد نتایج: 418498 فیلتر نتایج به سال:
Particle swarm optimization is an efficient population based algorithm used to solve real valued and nonlinear continuous optimization problems. To resolve binary optimization problems with PSO, binary particle swarm optimization (BPSO) has been developed. In this paper, optimum design of plates using BPSO is presented. The objective function aims at finding the optimum weight of plates with th...
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
this paper describes optimization method that combines the plackett-burman design, a factorial design and the response surface method, which were used to optimize the medium for the production of l-asparaginase by serratia marcescens sb08. four medium factors, from out of 11 medium factors, were screened by plackett-burman design experiments and subsequent optimization process to find out the o...
permanent magnet synchronous motors are efficient motors, which have widespread applications in electric industry due to their noticeable features. one of the interesting applications of such motors is in underwater vehicles. in these cases, reaching to minimum volume and high torque of the motor are the major concern. design optimization can enhance their merits considerably, thus reduce volum...
This paper applies an evolutionary algorithm, the particle swarm optimization (PSO), to design the optimum open channel section. Depth, channel side slope and bottom width are considered as the variables for rectangular, triangular and trapezoidal channels, respectively. The objective function is minimizing the construction cost of the channel section. MATLAB software is used for programming an...
Simulated Annealing and Genetic Algorithm are two well-known metaheuristic algorithms for combinatorial optimization. These two methods have also been used for solving constrained continuous problems. In this study, five constrained continuous problems have been solved both Simulated Annealing (SA) and Genetic Algorithm (GA). Optimum results have been compared with real optimum values obtained ...
Because of Polarimetric Synthetic Aperture Radar (PolSAR) contains the different features which relate to the physical properties of the terrain in unique ways, polarimetric imagery provides an efficient tool for the classification of the complex geographical areas. Support Vector Machines (SVMs) are particularly attractive in the remote sensing field due to their ability to handle the nonlinea...
Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید