FAST FUZZY FORCE-DIRECTED/SIMULATED EVOLUTION METAHEURISTIC FOR MULTIOBJECTIVE VLSI CELL PLACEMENT by Sait, Sadiq M.

“…The cell placement problem is a proven NP hard combinatorial optimization problem. The complexity of this problem increases when multiple optimization objectives are considered simultaneously. …”
Get full text

"A Tabu Search Approach for the Design of Variable Structure Load Frequency Controller Incorporating Model Nonlinearities" by Al-Hamouz, Z.

“…The proposed method formulates the design of VSC as an optimization problem and utilizes Tabu Search Algorithm (TS) to find the optimal settings of the controller. …”
Get full text

Definition and selection of fuzzy sets in genetic‐fuzzy systems using the concept of fuzzimetric arcs by Kouatli, Issam

“…An irregular shape may be required by some systems. Hence, a genetic algorithm was proposed as a methodology to optimize the performance of fuzzy systems by mutating different regular shapes. …”
Get full text
Get full text
Get full text
Get full text

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

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

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

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

Evaluating Parallel Simulated Evolution Strategies for VLSI Cell Placement by Sait, Sadiq M.

Get full text

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

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

Traffic Offloading with Channel Allocation in Cache-Enabled Ultra-Dense Wireless Networks by Abbas, Nadine

“…We also propose efficient sub-optimal hierarchical tree-based algorithms that operate in real time with dynamic and fast solutions for ultra dense networks. …”
Get full text
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

An evolutionary meta-heuristic for state justification insequential automatic test pattern generation by El-Maleh, A.H.

“…Evolutionary algorithms have been effective in solving many search and optimization problems. …”
Get full text
Get full text

The multi-parameterized cluster editing problem by Abu-Khzam, Faisal N.

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

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

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

Charge and reduce by Abu-Khzam, Faisal N.

Get full text
Get full text
Get full text

Fast force-directed/simulated evolution hybrid for multiobjective VLSI cell placement by Sait, Sadiq M.

“…VLSI standard cell placement is a hard optimization problem, which is further complicated with new issues such as power dissipation and performance. …”
Get full text
Get full text