Search alternatives:
could algorithm » mould algorithm (Expand Search), carlo algorithm (Expand Search), colony algorithm (Expand Search)
developing rd » developing a (Expand Search), developing _ (Expand Search)
rd algorithm » _ algorithms (Expand Search)
could algorithm » mould algorithm (Expand Search), carlo algorithm (Expand Search), colony algorithm (Expand Search)
developing rd » developing a (Expand Search), developing _ (Expand Search)
rd algorithm » _ algorithms (Expand Search)
-
1
Application of Red Deer Algorithm in Optimizing Complex functions
Published 2021“…The Red Deer algorithm (RDA), a recently developed population-based meta-heuristic algorithm, is examined in this paper with the optimization task of complex functions. …”
Get full text
Get full text
-
2
-
3
-
4
On the Optimization of Band Gaps in Periodic Waveguides
Published 2025Subjects: “…Nature-inspired optimization algorithms…”
-
5
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
6
-
7
Design of adaptive arrays based on element position perturbations
Published 1993“…The authors report on the design of a digital feedback control system to provide null steering by controlling the array element positions automatically. The array comprises a signal processor, digital control algorithm (PID), stepper motors, shaft encoders, actuators and multiplexers. …”
Get full text
Get full text
article -
8
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Get full text
Get full text
masterThesis -
9
-
10
Delay Optimization in LoRaWAN by Employing Adaptive Scheduling Algorithm With Unsupervised Learning
Published 2023“…Further, the delay is optimized by 91% and 79%. This research could be effective for the environments where the critical data of patients need to be sent with optimised retransmissions and minimum delay towards gateways.…”
-
11
Adaptive bias simulated evolution algorithm for placement
Published 2001“…A new solution is evolved from current solution by relocating some of the solution elements. Elements with lower goodnesses have higher probabilities of getting selected for perturbation. …”
Get full text
Get full text
article -
12
An improved kernelization algorithm for r-Set Packing
Published 2010“…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …”
Get full text
Get full text
Get full text
article -
13
A kernelization algorithm for d-Hitting Set
Published 2010“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
Get full text
Get full text
Get full text
article -
14
An exact and general model order reduction technique for the finite element solution of elastohydrodynamic lubrication problems
Published 2017“…This work presents an exact and general model order reduction (MOR) technique for a fast finite element resolution of elastohydrodynamic lubrication (EHL) problems. …”
Get full text
Get full text
Get full text
Get full text
article -
15
Fuzzy simulated evolution algorithm for topology design of campusnetworks
Published 2000“…The two main phases of the algorithm, namely, evaluation and allocation, have been fuzzified. …”
Get full text
Get full text
article -
16
Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements
Published 2023“…Therefore, we designed a dedicated two-stage strategy, inspired by the CPR algorithm, where a block preconditioner is used for the pressure part with the aim at exploiting the inner $$2\times 2$$ 2 × 2 structure. …”
-
17
Data redundancy management for leaf-edges in connected environments
Published 2022“…Although the sensed data could be useful for various applications (e.g., event detection in cities, energy management in commercial buildings), it first requires pre-processing to clean various inconsistencies (e.g., anomalies, redundancies, missing values). …”
Get full text
Get full text
Get full text
Get full text
article -
18
Intelligent Rapidly-Exploring Random Tree Star Algorithm
Published 2024Get full text
doctoralThesis -
19
A FUZZY EVOLUTIONARY ALGORITHM FOR TOPOLOGY DESIGN OF CAMPUS NETWORKS
Published 2020“…Comparison is also made with Esau–Williams (EW) algorithm, a well known constructive algorithm for the category of problems addressed in this work. …”
Get full text
article -
20
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. …”
Get full text
Get full text
article