An improved kernel for the undirected planar feedback vertex set problem by Abu-Khzam, Faisal N.

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

Accuracy of an internationally validated genetic-guided warfarin dosing algorithm compared to a clinical algorithm in an Arab population by Amr M. Fahmi (21632909)

“…After reaching warfarin maintenance dose, the dose was recalculated using the GWD and median absolute error (MAE) and the percentage of warfarin doses within 20% of the actual dose were calculated and compared for the two algorithms. …”

Predicting Dropouts among a Homogeneous Population using a Data Mining Approach by BILQUISE, GHAZALA

“…Our research reveals that the Gradient Boosted Trees is a robust algorithm that predicts dropouts with an accuracy of 79.31% and AUC of 88.4% using only pre-enrollment data. …”
Get full text

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

Natural optimization algorithms for optimal regression testing by Mansour, Nashat

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

New enumeration algorithm for regular boolean functions by Nasrallah, Walid F.

“…This algorithm exploits the equivalence between regular Boolean functions and positive threshold functions that can be used to represent instances of the knapsack problem. …”
Get full text
Get full text
Get full text
Get full text

Parallel genetic algorithm for disease-gene association by Mansour, Nashat

“…In this work, we combine few successful strategies from the literature and present a parallel genetic algorithm for the Tag SNP Selection problem. Our results compared favorably with those of a recognized tag SNP selection algorithm using three different data sets from the HapMap project.…”
Get full text
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 Full-System Approach of the Elastohydrodynamic Line/Point Contact Problem by Habchi, Wassim

“…The use of the finite element method allows the use of variable unstructured meshing and different types of elements within the same model which leads to a reduced size of the problem. …”
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). …”

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

A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks by Shaik, Muzibur Rehman

“…With such complex issues in the frameset, assigning weights to these large networks, resulting in the best cost is an NP-hard problem. In this thesis, a prudent approach of mitigating the mentioned problem by using a Stochastic Evolution (StocE) heuristic is used which provides a close to optimal solution to these kinds of problems. …”
Get full text