Search alternatives:
implementing future » implementing bundled (Expand Search), implementing surface (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
implementing future » implementing bundled (Expand Search), implementing surface (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
-
1
-
2
Bird’s Eye View feature selection for high-dimensional data
Published 2023“…This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …”
-
3
A parallel GPU implementation of the timber wolf placement algorithm
Published 2015“…Researchers agree that it is critical that EDA algorithms exploit future platforms and explore the use of parallel algorithms as we move to the many core era. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
4
An Adapted Load-Balancing implementation for Sharded Blockchains
Published 2024Get full text
Get full text
Get full text
masterThesis -
5
-
6
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
7
On the Optimization of Band Gaps in Periodic Waveguides
Published 2025Subjects: “…Nature-inspired optimization algorithms…”
-
8
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
9
-
10
-
11
-
12
Nonlinear analysis of shell structures using image processing and machine learning
Published 2023“…The proposed approach can be significantly more efficient than training a machine learning algorithm using the raw numerical data. To evaluate the proposed method, two different structures are assessed where the training data is created using nonlinear finite element analysis. …”
-
13
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 -
14
Teaching–learning-based optimization algorithm: analysis study and its application
Published 2024“…The structure of TLBO algorithms was first explained. Then, the implementation and the enhanced TLBO were examined and discussed in various areas such as engineering, electrical engineering, technology and science, mechanical design, artificial intelligence, classification problem, healthcare, and economics. …”
Get full text
-
15
Industrial Internet of Things enabled technologies, challenges, and future directions
Published 2023“…IIoT-enabled technologies have been reviewed and implemented in several research, but more research into the opportunities and challenges they present is necessary. …”
Get full text
Get full text
Get full text
article -
16
Industrial Internet of Things enabled technologies, challenges, and future directions
Published 2023“…IIoT-enabled technologies have been reviewed and implemented in several research, but more research into the opportunities and challenges they present is necessary. …”
-
17
Correlation Clustering with Overlaps
Published 2020“…Moreover, we allow the new vertex splitting operation, which allows the resulting clusters to overlap. In other words, data elements (or vertices) will be allowed to be members in more than one cluster instead of limiting them to only one single cluster, as in classical clustering methods. …”
Get full text
Get full text
Get full text
masterThesis -
18
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 -
19
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 -
20
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