Search alternatives:
lacking algorithm » learning algorithms (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
lacking algorithm » learning algorithms (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
-
41
Web Based Online Hybrid Teaching Method of Network Music Course
Published 2022“…In the context of big data, the lengthy personalized screening process of users has become one of the problems to be solved. Based on Web data mining, an improved algorithm of hybrid hierarchical recommendation algorithm and genetic algorithm is used in the experiment, and compared with the other two algorithms in the experiment. …”
Get full text
-
42
-
43
Design of adaptive arrays based on element position perturbations
Published 1993“…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
Get full text
Get full text
article -
44
-
45
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. …”
-
46
The Use of Microwave Tomography in Bone Healing Monitoring
Published 2019Get full text
doctoralThesis -
47
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
Published 2000Get full text
Get full text
masterThesis -
48
-
49
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 -
50
Improved prairie dog optimization algorithm by dwarf mongoose optimization algorithm for optimization problems
Published 2023“…In this paper, a novel hybrid optimization algorithm is proposed to solve various benchmark functions, which is called IPDOA. …”
Get full text
-
51
Nonlinear analysis of shell structures using image processing and machine learning
Published 2023“…In general, such problems in design optimisation or virtual reality applications must be solved repetitively in a short period using direct methods such as nonlinear finite element analysis. …”
-
52
Stochastic optimal power flow framework with incorporation of wind turbines and solar PVs using improved liver cancer algorithm
Published 2024“…<p dir="ltr">The present study introduces a nature inspired improved liver cancer algorithm (ILCA) for solving the non‐convex engineering optimization issues. …”
-
53
-
54
Fuzzy genetic algorithm for floorplanning
Published 2020“…Genetic algorithms (GAs) have been found to be very effective in solving numerous optimization problems, especially those with many (possibly) conflicting and noisy objectives. …”
Get full text
article -
55
-
56
-
57
Optimum sensors allocation for drones multi-target tracking under complex environment using improved prairie dog optimization
Published 2024“…The IPDOA performance was compared with the other 8 metaheuristic optimization algorithms and the testing showed its superiority over those techniques for solving this complex problem. …”
Get full text
-
58
Stochastic Search Algorithms for Exam Scheduling
Published 2007“…A good exam schedule should aim to minimize conflicts and the two unfairness factors based on user-assigned weights to these three factors and subject to some constraints such as classrooms’ number and capacities. In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. …”
Get full text
Get full text
article -
59
A simulated annealing algorithm for unit commitment
Published 1998“…This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). …”
Get full text
Get full text
article -
60
A kernelization algorithm for d-Hitting Set
Published 2010“…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
Get full text
Get full text
Get full text
article