بدائل البحث:
making algorithm » cosine algorithm (توسيع البحث)
method algorithm » mould algorithm (توسيع البحث)
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
making algorithm » cosine algorithm (توسيع البحث)
method algorithm » mould algorithm (توسيع البحث)
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
-
1
-
2
-
3
-
4
Bird’s Eye View feature selection for high-dimensional data
منشور في 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
An improved HIC using a new ordering and grouping algorithm
منشور في 2003"…For this reason, we propose a new ordering and grouping algorithm that yields a tight upper bound, which, in turn, results in a higher convergence speed. …"
احصل على النص الكامل
احصل على النص الكامل
article -
6
-
7
Brain Source Localization in the Presence of Leadfield Perturbations
منشور في 2015احصل على النص الكامل
doctoralThesis -
8
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
منشور في 2016الموضوعات: احصل على النص الكامل
doctoralThesis -
9
A new ordering and grouping algorithm for the linear weighted group matched filter successive interference cancellation detector
منشور في 2006"…For this reason, a new upper bound for the maximum eigenvalue of the system's transition matrix was developed. Moreover, a new ordering and grouping algorithm that results in a higher convergence speed is proposed. …"
احصل على النص الكامل
احصل على النص الكامل
article -
10
-
11
A reduced model for phase-change problems with radiation using simplified PN approximations
منشور في 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. …"
احصل على النص الكامل
article -
12
-
13
Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study
منشور في 2021"…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …"
احصل على النص الكامل
article -
14
-
15
Design of adaptive arrays based on element position perturbations
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
article -
16
The Use of Microwave Tomography in Bone Healing Monitoring
منشور في 2019احصل على النص الكامل
doctoralThesis -
17
Nonlinear analysis of shell structures using image processing and machine learning
منشور في 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. …"
-
18
Higher-order statistics (HOS)-based deconvolution for ultrasonic nondestructive evaluation (NDE) of materials
منشور في 1997"…Performance evaluation of the proposed methods and comparisons with existing methods are made by means of Monte-Carlo simulations, experimental data and analysis. The first scheme makes use of the complex cepstrum of the third-order cumulants (complex bicepstrum) of the ultrasonic signals. …"
احصل على النص الكامل
masterThesis -
19
Correlation Clustering with Overlaps
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
20
A kernelization algorithm for d-Hitting Set
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article