401 citations
- Universidad Autónoma de MadridES142 papers
- Johns Hopkins UniversityUS116 papers
- Université Libre de BruxellesBE115 papers
- University of WarsawPL115 papers
- Brown UniversityUS113 papers
- California Institute of TechnologyUS113 papers
- Charles UniversityCZ113 papers
- Eötvös Loránd UniversityHU113 papers
- Fermi National Accelerator LaboratoryUS113 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di Roma IIT113 papers
- Tata Institute of Fundamental ResearchIN113 papers
- University College DublinIE113 papers
4 papers · 2 filters
An Improved One-to-All Broadcasting in Higher Dimensional Eisenstein-Jacobi Networks
Zaid Hussain
Recently, a higher dimensional Eisenstein-Jacobi networks, has been proposed in [22], which is shown that they have better average distance with more number of nodes than a single…
A GPU-Based Genetic Algorithm for the P-Median Problem
Bader F. AlBdaiwi, Hosam M. F. AboElFotoh
The p-median problem is a well-known NP-hard problem. Many heuristics have been proposed in the literature for this problem. In this paper, we exploit a GPGPU parallel computing pl…
Heuristics for the Variable Sized Bin Packing Problem Using a Hybrid P-System and CUDA Architecture
Qadha'a AlEnezi, Hosam AboElFotoh, Bader AlBdaiwi +1
The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing. Given a list of items and variable sized bin types, t…
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks
Bader AlBdaiwi, Zaid Hussain, Anton Cerny +1
Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. De…