A Tabu Search algorithm for mapping data to multicomputers. (c1997) by Diab, Kamal M.

Get full text
Get full text

Allocating data to distributed-memory multiprocessors by genetic algorithms by Mansour, Nashat

“…We present three genetic algorithms (GAs) for allocating irregular data sets to multiprocessors. …”
Get full text
Get full text
Get full text

A neural networks algorithm for data path synthesis by Harmanani, Haidar M.

“…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text

Sensitivity to parameters and general applicability of genetic algorithms and simulated annealing algorithms for mapping data to multicomputers. (c1994) by Kawash, Jalal Y.

Get full text
Get full text

Physical optimization algorithms for mapping data to distributed-memory multiprocessors by Mansour, Nashat

“…We present three parallel physical optimization algorithms for mapping data to distributed-memory multiprocessors, concentrating on irregular loosely synchronous problems. …”
Get full text
Get full text
Get full text

Parallel physical optimization algorithms for allocating data to multicomputer nodes by Mansour, Nashat

“…Three parallel physical optimization algorithms for allocating irregular data to multicomputer nodes are presented. …”
Get full text
Get full text
Get full text

DG-Means – A Superior Greedy Algorithm for Clustering Distributed Data by Assaf, Ali

“…In this work, we present DG-means, which is a greedy algorithm that performs on distributed sets of data. …”
Get full text
Get full text
Get full text

Design of acoustic absorbing metasurfaces using a data-driven approach by Hamza Baali (14603380)

Subjects:

A Genetic Algorithm for Improving Accuracy of Software Quality Predictive Models by Azar, Danielle

“…In this paper, we present a genetic algorithm that adapts such models to new data. We give empirical evidence illustrating that our approach out-beats the machine learning algorithm C4.5 and random guess.…”
Get full text
Get full text
Get full text

An ant colony optimization algorithm to improve software quality prediction models by Azar, D.

“…For this purpose, software quality prediction models have been extensively used. However, building accurate prediction models is hard due to the lack of data in the domain of software engineering. …”
Get full text
Get full text
Get full text

Optimizing transparent photovoltaic integration with battery energy storage systems in greenhouse: a daily light integral-constrained economic analysis considering BESS degradation by Gholami, Mohammadreza

Subjects: Get full text
Get full text
Get full text

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

“…However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. …”

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

Subjects: Get full text

Efficient Approximate Conformance Checking Using Trie Data Structures by Awad, Ahmed

Subjects: “…Estimation error,Runtime,Computational modeling,Data structures,Approximation algorithms,Encoding,Computational efficiency…”
Get full text
Get full text
Get full text

Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

“…It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. …”
Get full text
Get full text

Optimizing transparent photovoltaic integration with battery energy storage systems in greenhouse: a daily light integral-constrained economic analysis considering BESS degradation by Mohammadreza Gholami (17032317)

Subjects:

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

Subjects:

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

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

Correlation Clustering with Overlaps by Fakhereldine, Amin

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

Development of an Optimization Algorithm for Internet Data Traffic by Misbahuddin, Syed

“…In this paper, an optimization algorithm is proposed to reduce net data traffic, which works at Internet layer in the TCP/IP reference model. …”
Get full text