Test case generation for path coverage. (c2000) by Salame, Miran

Get full text
Get full text

Fuzzy simulated evolution algorithm for multi-objectiveoptimization of VLSI placement by Sait, Sadiq M.

“…A fuzzy simulated evolution algorithm is presented for multi-objective minimization of VLSI cell placement problem. …”
Get full text
Get full text

An intensive and comprehensive overview of JAYA algorithm, its versions and applications by Abou Doush, Iyad

“…The JAYA algorithm combines the survival of the fittest principle from evolutionary algorithms as well as the global optimal solution attractions of Swarm Intelligence methods. …”
Get full text
Get full text

Scatter search algorithm for the cross-dock door assignment problem by Tarhini, Abbas

“…In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text

Natural optimization algorithms for the cross-dock door assignment problem by Tarhini, Abbas A.

“…This paper modifies a classical mathematical model that represents the CDAP and implements an evolutionary metaheuristic SS algorithm and tests it and then compares the results with those of another evolutionary algorithm, i.e., genetic algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text

Cooperative Co-evolution using The Brain Storm Optimization Algorithm by El-Abd, Mohammed

“…In this paper, the implementation of a Cooperative Co-evolutionary BSO (CCBSO) algorithm that is based on the explicit space decomposition approach is investigated. …”
Get full text
Get full text

On the steiner walk problem. (c2009) by Maarouf, Amina

Get full text
Get full text

Using genetic algorithms to optimize software quality estimation models by Azar, Danielle

“…This thesis explores the use of genetic algorithms for the problem of optimizing existing rule-based software quality estimation models. …”
Get full text
Get full text
Get full text

Genetic and heuristic algorithms for regrouping service sites. (c2000) by Tabbara, Hiba

Get full text
Get full text

A fast exact sequential algorithm for the partial digest problem by Mostafa M. Abbas (17058093)

“…The algorithm is able to find all possible solutions for the input and works by traversing the solution tree with a breadth-first search in two stages and deleting all repeated subproblems. …”

A Tabu Search-Based Algorithm For The Fuzzy Clustering Problem by AlSultan, K.S.

“…In this paper, we propose a new approach to this problem which is based on tabu search technique, and aims at finding a global solution of FCP. We compare the performance of the algorithm with the fuzzy Cmeans algorithm.…”
Get full text

A fast constructive algorithm for fixed channel assignment problem by Khan, J.A.

“…In this work, a fast constructive algorithm is introduced to solve the problem. The objective of the algorithm is to obtain a conflict free channel assignment to cells which satisfies traffic demand requirements. …”
Get full text
Get full text

A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units by El-Amin, I.

“…The implicit enumeration algorithm was used to check the validity and the quality of the Tabu search solution. …”
Get full text

A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units by Duffuaa, S. O.

“…The implicit enumeration algorithm was used to check the validity and the quality of the Tabu search solution. …”
Get full text

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

“…The performances of these algorithms are evaluated and compared. The three parallel algorithms maintain the good solution qualities of their sequential counterparts. …”
Get full text
Get full text
Get full text

Bee colony algorithm for assigning proctors to exams. (c2013) by Taha, Mohamad Kassem

Get full text
Get full text

Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm by Nasser, Youssef

“…This work aims to enhance the performance of the K-means algorithm by introducing a novel method for selecting the initial centroids, thereby minimizing randomness and reducing the number of iterations needed to reach optimal results. …”
Get full text
Get full text
Get full text

Parallel scatter search algorithms for exam timetabling. (c2009) by Haidar, Ghia Abdullah Sleiman

Get full text
Get full text

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

“…An important feature of these algorithms is that they deviate from the operation of their sequential counterparts in order to achieve reasonable speed-ups and, yet, they maintain similar solution qualities. …”
Get full text
Get full text
Get full text

Economic load dispatch using memetic sine cosine algorithm by Abu Zitar, Raed

“…In this paper, the economic load dispatch (ELD) problem which is an important problem in electrical engineering is tackled using a hybrid sine cosine algorithm (SCA) in a form of memetic technique. ELD is tackled by assigning a set of generation units with a minimum fuel costs to generate predefined load demand with accordance to a set of equality and inequality constraints. …”
Get full text