Bird’s Eye View feature selection for high-dimensional data by Samir Brahim Belhaouari (16855434)

“…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. …”

A combined algorithm based on finite elements and a modified methodof characteristics for the analysis of the corona in wire-ductelectrostatic precipitators by Al-Hamouz, Z.M.

Get full text
Get full text

Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars by Abathar Al-Hamrani (16494884)

Subjects:

On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

Subjects:

Design of adaptive arrays based on element position perturbations by Dawoud, M.M.

“…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

Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices by Khawam, Yahya Bader

Subjects: Get full text

Particle swarm optimization algorithm: review and applications by Abualigah, Laith

“…Particle swarm optimization (PSO) is a heuristic global optimization technique and an optimization algorithm that is swarm intelligence-based. It is based on studies into the movement of bird flocks. …”
Get full text

Adaptive bias simulated evolution algorithm for placement by Youssef, H.

“…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

An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

“…We present a reduction procedure that takes an arbitrary instance of the r -Set Packing problem and produces an equivalent instance whose number of elements is in O(kr−1), where k is the input parameter. …”
Get full text
Get full text
Get full text

A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

“…In this paper, a kernelization algorithm for the 3-Hitting Set problem is presented along with a general kernelization for d -Hitting Set. …”
Get full text
Get full text
Get full text

An exact and general model order reduction technique for the finite element solution of elastohydrodynamic lubrication problems by Habchi, W.

“…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

A New Hamiltonian Semi-Analytical Approach to Vibration Analysis of Piezoelectric Multi-Layered Plates by Andrianarison, O.

“…Within the framework of this Hamiltonian formalism, the in-plane of the piezoelectric multilayered plate is discretized into two-dimensional p-type high-order spectral finite elements while the resulting first-order one dimensional differential system is solved analytically by enforcing the interface continuity constraints. …”
Get full text

Intelligent Rapidly-Exploring Random Tree Star Algorithm by Ahmed, Khidir Galal Eldin Khidir

Get full text

Fuzzy simulated evolution algorithm for topology design of campusnetworks by Youssef, H.

“…It consists of deciding the number, type, and location of the active network elements (nodes) and links. This choice is dictated by physical and technological constraints and must optimize several objectives. …”
Get full text
Get full text

Properties of Unique Degree Sequences of 3-Uniform Hypergraphs by Tarsissi, Lama

“…Then, we find the asymptotic growth rate of the maximal element of the representatives in terms of the length of the sequence, with the aim of generating and then reconstructing them. …”
Get full text

Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements by Stefano Nardean (14151900)

“…This preconditioner, denoted as Block CPR (BCPR), is specifically designed for Lagrange multipliers-based flow models, such as those generated by Mixed Hybrid Finite Element (MHFE) approximations. An original MHFE-based formulation of the two-phase flow model is taken as a reference for the development of the BCPR preconditioner, in which the set of system unknowns comprises both element and face pressures, in addition to the cell saturations, resulting in a $$3\times 3$$ 3 × 3 block-structured Jacobian matrix with a $$2\times 2$$ 2 × 2 inner pressure problem. …”

A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

“…This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. …”
Get full text
Get full text

A FUZZY EVOLUTIONARY ALGORITHM FOR TOPOLOGY DESIGN OF CAMPUS NETWORKS by Youssef, H.

“…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

Evolutionary algorithms for state justification in sequential automatic test pattern generation by El-Maleh, Aiman H.

“…A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text

RHEEMix in the data jungle: a cost-based optimizer for cross-platform systems. by Sebastian Kruse (18595195)

“…Our main contributions are: (i) a mechanism based on graph transformations to explore alternative execution strategies; (ii) a novel graph-based approach to determine efficient data movement plans among subtasks and platforms; and (iii) an efficient plan enumeration algorithm, based on a novel enumeration algebra. …”