Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithms » cosine algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithms » cosine algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
-
1
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…The layout problem considered in this paper is a static layout problem characterized by affinity weights used to model transportation costs between facilities and by geometric constraints between relative positions of facilities on site. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
2
A reduced model for phase-change problems with radiation using simplified PN approximations
Published 2025“…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
Get full text
article -
3
Capturing outline of fonts using genetic algorithm and splines
Published 2001“…The chromosomes have been constructed by considering the candidates of the locations of knots as genes. The best model among the candidates is searched by using the Akaike Information Criterion (AIC). …”
Get full text
Get full text
article -
4
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
Published 2002“…The layout problem considered in this paper is characterized by affinity weights used to model transportation costs between facilities and by geometric constraints that limit their relative positions on site. …”
Get full text
Get full text
Get full text
article -
5
A method for the minimum coloring problem using genetic algorithms
Published 2006“…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. …”
Get full text
Get full text
Get full text
conferenceObject -
6
A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†
Published 2010“…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …”
Get full text
Get full text
Get full text
article -
7
A New Parallel Genetic Algorithm Model
Published 2020“…This paper presents an implementation of three Genetic Algorithm models for solving a reliability optimization problem for a redundancy system with several failure modes, a modification on a parallel a genetic algorithm model and a new parallel genetic algorithm model. …”
Get full text
article -
8
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
9
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
10
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text
article -
11
Parameter Estimation Of Wiener-Hammerstein Models Via Genetic Algorithms
Published 2020“…In this paper, a modified genetic algorithm is used as a procedure to solve the parameter identification problem of the nonlinear Wiener-Hammerstein models. …”
Get full text
article -
12
-
13
A genetic-based algorithm for fuzzy unit commitment model
Published 2000“…The genetic algorithm (GA) approach is then used to solve the proposed fuzzy UCP model. …”
Get full text
Get full text
article -
14
Minimizing using BBO and DFO methods
Published 2022“…The goal of this thesis is to develop two MATLAB codes for the numerical algorithm of [1]. To solve nonlinear differential equations we use Runge-Kutta method of fourth order, and for the minimization part, we use two different methods, namely Nelder-Mead and Model Based Descent methods. …”
Get full text
Get full text
Get full text
masterThesis -
15
-
16
Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms
Published 2022“…Therefore, in this study we examined this market based on the price index of the automotive group, then optimized a portfolio of automotive companies using two methods. In the first method, the CVaR measurement was modeled by means of DEA, then Particle Swarm Optimization (PSO) and the Imperial Competitive Algorithm (ICA) were used to solve the proposed model. …”
-
17
-
18
-
19
Optimum sensors allocation for drones multi-target tracking under complex environment using improved prairie dog optimization
Published 2024“…The Extended Kalman Filter (EKF) is used for state estimation with proper clutter and detection models. …”
Get full text
-
20
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
Published 1998“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text
article