Search alternatives:
method algorithm » mould algorithm (Expand Search)
model algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
joint » point (Expand Search)
method algorithm » mould algorithm (Expand Search)
model algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
joint » point (Expand Search)
-
1
-
2
Modeling and Control of a Robot Based Rehabilitation System for the Head-Neck Joint
Published 2024Get full text
doctoralThesis -
3
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
4
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. …”
-
5
-
6
-
7
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 -
8
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
9
Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study
Published 2021“…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …”
Get full text
article -
10
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. …”
-
11
-
12
The Use of Microwave Tomography in Bone Healing Monitoring
Published 2019Get full text
doctoralThesis -
13
-
14
-
15
Label dependency modeling in Multi-Label Naïve Bayes through input space expansion
Published 2024“…We subject our enhanced iMLNB model to a rigorous empirical evaluation, utilizing six benchmark datasets. …”
-
16
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 -
17
Joint BS Assignment and End-to-End Scheduling for Wireless Cellular Networks with Heterogeneous Services
Published 2010“…In this work, we extend the end-to-end scheduling approach by designing and evaluating a joint scheduling and BS assignment algorithm in order to further improve the system performance. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
18
Joint computing, communication and cost-aware task offloading in D2D-enabled Het-MEC
Published 2022“…Furthermore, we propose a low-complexity algorithm that generates high performance results and can be applied for large-scale networks. …”
Get full text
Get full text
Get full text
Get full text
article -
19
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 -
20
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