Joint Planning of Smart EV Charging Stations and DGs in Eco-Friendly Remote Hybrid Microgrids by Shaaban, Mostafa

“…The planning problem jointly allocates and sizes a set of distributed generators (DGs) along with the EV charging stations to balance the supply with the total demand of regular loads and EV charging. The planning algorithm specifies optimal locations and sizes of the EV charging stations and DG units that minimize two conflicting objectives: (a) deployment and operation costs and (b) associated green house gas emissions, while satisfying the microgrid technical constraints. …”
Get full text

Enhancing Healthcare Systems With Deep Reinforcement Learning: Insights Into D2D Communications and Remote Monitoring by Zina Chkirbene (16869987)

“…By formulating the video resource allocation challenge as a multi-objective optimization problem, the framework aims to minimize network delays while respecting node capacity limitations. …”

Dynamic single node failure recovery in distributed storage systems by Itani, M.

“…To minimize the system repair cost, we formulate our problem using incidence matrices and solve it heuristically using genetic algorithms for all possible cases of single node failures. …”
Get full text
Get full text
Get full text
Get full text

Timing driven genetic placement by Sait, Sadiq M.

“…IN this paper we present a timing driven placer for standard cell IC design. The placement algorithm follows the genetic paradigm, with the objective of minimizing both area and path slacks. …”
Get full text

Economic Production Lot-Sizing For An Unreliable Machine Under Imperfect Age-Based Maintenance Policy by El-Ferik, S

“…Some useful properties of the cost function are developed to characterize the optimal policy. An algorithm is also proposed to find the optimal solutions to the problem at hand. …”
Get full text

Multi Agent Reinforcement Learning Approach for Autonomous Fleet Management by Alhusin, Mohammed Omer Alamin

Get full text

Design and analysis of entropy-constrained reflected residual vector quantization by Mousa, W.A.H.

“…Residual vector quantization (RVQ) is a vector quantization (VQ) paradigm which imposes structural constraints on the encoder in order to reduce the encoding search burden and memory storage requirements of an unconstrained VQ. Jointly optimized RVQ (JORVQ) is an effective design algorithm for minimizing the overall quantization error. …”
Get full text
Get full text

Autonomous Robot Navigation Based On Recurrent Neural Networks by Al-Sagban, Mariam Qusai

Get full text

Energy-Efficient VoI-Aware UAV-Assisted Data Collection in Wireless Sensor Networks by Kalash, Saeddin

“…This study aims to reduce redundant data collection while deploying the minimum number of UAVs, minimizing energy consumption and maximizing VoI. We first formulate the general problem and solve it as a multi-objective optimization problem. …”
Get full text
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

A COMPLETE INSPECTION PLAN FOR DEPENDENT MULTICHARACTERISTIC CRITICAL COMPONENTS by Duffuaa, S. O.

“…A mathematical model and an algorithm for obtaining the optimal number of repeat inspections are developed and demonstrated by an example. …”
Get full text

Performance driven standard-cell placement using the geneticalgorithm by Youssef, H.

“…In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. Besides optimizing for area and wire length, the placer minimizes the propagation delays on a predicted set of critical paths. …”
Get full text
Get full text

Resource allocation scheme for eMBB and uRLLC coexistence in 6G networks by Muhammed Al-Ali (16810677)

“…The simulation results show that the proposed algorithm outperforms the above-mentioned reference algorithms in all evaluation metrics and is proved to be comparable to the optimal solution given its low complexity.…”

Design of a vibration absorber for harmonically forced damped systems by Issa, Jimmy

“…The absorber is placed between the primary system and the supporting ground. The optimal absorber parameters are obtained with the aim of minimizing the maximum of the primary system frequency response. …”
Get full text
Get full text
Get full text
Get full text

Scatter search technique for exam timetabling by Mansour, Nashat

“…We evaluate our suggested technique on real-world university data and compare our results with the registrar’s manual timetable in addition to the timetables of other heuristic optimization algorithms. The experimental results show that our adapted scatter search technique generates better timetables than those produced by the registrar, manually, and by other meta-heuristics.…”
Get full text
Get full text
Get full text

General Inspection Plan For Critical Multicharacteristic Components by Duffuaa, S. O.

“…A mathematical model that depicts and represents the plan has been developed. A decent type algorithm is proposed to determine the optimal number of repeat inspections and sequence characteristics for inspection that minimizes the expected total cost. …”
Get full text

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

“…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. Through this work, an attempt has been made to optimize the weights on the network so as to minimize congestion. …”
Get full text

Dynamic Layout Planning Using a Hybrid Incremental Solution Method by Zouein, Pierrette

“…Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. …”
Get full text
Get full text
Get full text

Practical single node failure recovery using fractional repetition codes in data centers by Itani, May

“…In addition, we account for new-comer blocks and allocate them to nodes with minimal computations and without changing the original optimal schema. …”
Get full text
Get full text
Get full text
Get full text

An easy-to-use scalable framework for parallel recursive backtracking by Abu-Khzam, Faisal N.

“…Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so far been limited success in obtaining large scale parallelism. …”
Get full text
Get full text
Get full text