Digital circuit design through simulated evolution (SimE) by Sait, Sadiq M.

“…Area, power and delay are considered in the optimization of circuits. Results obtained by SimE algorithm are compared to those obtained by genetic algorithm (GA).…”
Get full text
Get full text

On the parameterized parallel complexity and the vertex cover problem by Abu-Khzam, Faisal N.

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

GENETIC SCHEDULING OF TASK GRAPHS by Benten, M. S.

“…The problem of assigning tasks to processing elements as a combinatorital optimization is formulated, and a heuristic based on a genetic algorithm is presented. …”
Get full text

HPTS: heterogeneous parallel tabu search for VLSI placement by Al-Yamani, A.

“…Two parallelization strategies, i.e., functional decomposition and multi-search thread strategies are integrated. The proposed algorithm is tested on the VLSI standard cell placement problem, however, the same algorithm can be used on any combinatorial optimization problem. …”
Get full text
Get full text

A combinatorial auction‐based approach for ridesharing in a student transportation system by Chefi Triki (14158860)

“…Three meta-heuristics, namely particle swarm optimization, dragonfly algorithm, and imperialist competitive algorithm, are implemented in the proposed framework, whose performances are assessed and compared. …”

Uplink Noma in UAV-Assisted IoT Networks by Mrad, Ali

“…Given the complexity of the problem and the incomplete knowledge about the environment, the problem is divided into two subproblems: the first models the UAV trajectory and the selection of the first device in the NOMA cluster at each time slot as a Markov Decision Process, and uses Proximal Policy Optimization to solve it. The second device is then selected using a heuristic algorithm based on prioritizing devices with higher bit rate requirements and strict deadlines. …”
Get full text
Get full text
Get full text

Second-order conic programming for data envelopment analysis models by Mourad, Nahia

“…Indeed, the aforesaid method is based on mathematical optimization. This paper constructs a second-order conic optimization problem unifying several DEA models. …”
Get full text
Get full text

A linear programming approach for the weighted graph matchingproblem by Almohamad, H.A.

“…A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a simplex-based algorithm. …”
Get full text
Get full text

Simulated evolution for timing and low power VLSI standard cell placement by Sait, Sadiq M.

“…For this hard multiobjective combinatorial optimization problem, no known exact and efficient algorithms exist that guarantee finding a solution of specific or desirable quality. …”
Get full text

An innovative simulated annealing approach to the long-term hydroscheduling problem by Mantawy, A.H.

“…A significant reduction in the number of the objective function evaluations, and consequently less iterations are required to reach the optimal solution. The proposed algorithm has been applied successfully to solve a system with four series cascaded reservoirs. …”
Get full text
Get full text

Final exams scheduling for univeristies. (c2001) by Timany, Mazen Nuhad

Get full text
Get full text

Scheduling and allocation in high-level synthesis using stochastic techniques by Sait, Sadiq M.

“…Scheduling and allocation can be formulated as an optimization problem. In this work, a unique approach to scheduling and allocation problem using the genetic algorithm (GA) is described. …”
Get full text

A novel network-based SIS framework for improved GA performance by Tohme, Rawane

“…Genetic algorithms have long been used to solve complex optimization problems by mimicking natural selection processes. …”
Get full text
Get full text
Get full text

Data Generation for Path Testing by Mansour, Nashat

“…These algorithms are based on an optimization formulation of the path testing problem which include both integer- and real-value test cases. …”
Get full text
Get full text
Get full text

Protein structure prediction in the 3D HP model by Abu-Khzam, Faisal

“…In this paper, we present a Particle Swarm Optimization (PSO) based algorithm for predicting protein structures in the 3D HP model. …”
Get full text
Get full text
Get full text
Get full text

Evacuation of a highly congested urban city by El Khoury, John

“…The algorithm uses Dijkstras algorithm to find the shortest path(s) and a modified greedy algorithm to assign maximum flows to selected paths given a specific schedule per time interval. …”
Get full text
Get full text
Get full text

Robust Kalman filter and smoother for errors-in-variables model with observation outliers based on Least-Trimmed-Squares by ALMutawa, Jaafar

“…Since the LTS is combinatorial optimization problem the randomized algorithm has been proposed in order to achieve the optimal estimate. …”
Get full text

A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM by Al-Mohamad, HA

“…A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a Simplex-based algorithm. …”
Get full text

Genetic Fuzzimetric Technique (GFT) by Kouatli, Issam

“…Integration of fuzzy systems with genetic algorithm has been identified by researchers as a useful technique of optimizing systems under uncertainty. …”
Get full text
Get full text
Get full text
Get full text

Query acceleration in distributed database systems by Haraty, Ramzi A.

“…Many techniques and algorithms have been proposed to optimize queries. Perhaps one of the more important algorithms is the AHY algorithm using semi-joins that is implemented by Apers, Hevner and Yao in [1]. …”
Get full text
Get full text
Get full text