Delay Optimization in LoRaWAN by Employing Adaptive Scheduling Algorithm With Unsupervised Learning by Zulfiqar Ali (117651)

“…This paper aims to optimize the delay in LoRaWAN by using an Adaptive Scheduling Algorithm (ASA) with an unsupervised probabilistic approach called Gaussian Mixture Model (GMM). …”

An Uncertainty Based Genetic Algorithm Approach for Project Resource Scheduling by ALKETBI, SAIF

“…The work presented in thesis add to the existing literature in a proposing the use of a genetic algorithm uncertain approach to resource- scheduling in projects. …”
Get full text

An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications by Abu Zitar, Raed

“…The various applications tackled using relevant versions of JAYA algorithm are also discussed and summarized based on several problem domains. …”
Get full text

A simulated annealing algorithm for unit commitment by Mantawy, A.H.

“…This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). …”
Get full text
Get full text

Artificial neural network algorithms. (c1999) by Ramadan, Samer N.

Get full text
Get full text

A Hybrid Approach for Predicting Critical Machining Conditions in Titanium Alloy Slot Milling Using Feature Selection and Binary Whale Optimization Algorithm by Amirsajjad Rahmani (17541453)

Secure Storage of Crypto Wallet Seed Phrase Using ECC and Splitting Technique by Syeda Tayyaba Bukhari (21842078)

Just-in-time defect prediction for mobile applications: using shallow or deep learning? by Raymon van Dinter (10521952)

Natural optimization algorithms for optimal regression testing by Mansour, Nashat

Get full text
Get full text
Get full text
Get full text

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

“…The resulting instance is called a problem kernel. 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

Asymptotically faster algorithms for parameterized FACE COVER by Abu-Khzam, Faisal N.

Get full text
Get full text
Get full text

Metaheuristic Algorithm for State-Based Software Testing by Haraty, Ramzi A.

“…We formulate the testing problem as an optimization problem and use a simulated annealing (SA) metaheuristic algorithm to generate test cases as sequences of events while keeping the test suite size reasonable. …”
Get full text
Get full text
Get full text
Get full text

Incremental & classical genetic algorithm. (c2001) by Awad, Mohamad M.

Get full text
Get full text

An L2 Gap Metric Identification Algorithm by Al-Amer, Samir Hasan

“…Each iteration of the algorithm involves solving a weighted least squares approximation problem. …”
Get full text

A New Parallel Genetic Algorithm Model by Al-Somani, Turki F.

“…This paper presents an implementation of three Genetic Algorithm models for solving a reliability optimization problem for a redundancy system with several failure modes, a modification on a parallel a genetic algorithm model and a new parallel genetic algorithm model. …”
Get full text

Empirical comparison of regression test selection algorithms by Mansour, Nashat

“…In the maintenance phase, the regression test selection problem refers to selecting test cases from the initial suite of test cases used in the development phase. …”
Get full text
Get full text
Get full text

A matheuristic approach for solving the 2-connected dominating set problem by Raka Jovanovic (17947838)

“…The algorithm is based on a Greedy Randomized Adaptive Search Procedure (GRASP). …”

Novel algorithms for accurate DNA base-calling by Mohammed, Omniyah Gul

Get full text

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

“…The main procedure of the PSO algorithm is presented. Future researchers can use the collected data in this survey as baseline information on the PSO and PSO's applications.…”
Get full text

Highly scalable parallel search-tree algorithms by Abu-Khzam, Faisal N.

“…We introduce the notion of a virtual topology and explore the use of search-tree indexing to achieve highly scalable parallel search-tree algorithms for NP-hard problems. …”
Get full text
Get full text
Get full text
Get full text