Mobile hospitals routing for prioritized patients by Tarhini, Abbas

“…A recognized problem in this domain is minimizing the cost of mobile hospitals rout in a way that the number of served patients is maximized. …”
Get full text
Get full text

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

Mobile clinics routing in response to covid-19 outbreak: an intelligent hyperheuristic approach by Danach, Kassem

“…A recognized problem in this domain is minimizing the cost of mobile clinics route in a way that the number of served patients is maximized. …”
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

FoGMatch by Arisdakessian, Sarhad

“…Our solution consists of (1) two optimization problems, one for the IoT devices and one for the fog nodes, (2) preference functions for both the IoT and fog layers to help them rank each other on the basis of several criteria such latency and resource utilization, and (3) centralized and distributed intelligent scheduling algorithms that consider the preferences of both the fog and IoT layers to improve the performance of the overall IoT ecosystem. …”
Get full text
Get full text
Get full text

On scalable 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

Reinforcement R-learning model for time scheduling of on-demand fog placement by Farhat, Peter

“…This choice is subject to study the demand of a particular location for services in order to maximize the resources utilization of these fogs. A simple algorithm will not be able to explore randomly changing users’ demands. …”
Get full text
Get full text
Get full text
Get full text

UAV-Aided Projection-Based Compressive Data Gathering in Wireless Sensor Networks by Ebrahimi, Dariush

“…Our problem definition aims at clustering the sensors, constructing an optimized forwarding tree per cluster, and gathering the data from selected cluster head nodes based on projection-based CDG with minimized UAV trajectory distance. …”
Get full text
Get full text
Get full text
Get full text

Improving the Resilience of Smart Distribution Networks against Cyber Attacks by ElYamani, Mohamed ElHusseiny Mohamed

Get full text

MoveSchedule by Zouein, Pierette

“…The layout construction algorithm that underlies MoveSchedule uses Constraint Satisfaction to find the set of all positions that meet the constraints on resources' positions and Linear Programming to find the optimal positions that minimize resource transportation and relocation costs. …”
Get full text
Get full text
Get full text

Collaborative Caching for D2D Content Sharing in 5G by Abdelsalam, Ansam Elfadil Kamel

Get full text

Practical Multiple Node Failure Recovery in Distributed Storage Systems by Itani, M.

“…We allocate newcomers to nodes with minimal computations and without changing the original optimized plan. …”
Get full text
Get full text
Get full text
Get full text

Exploring AI Conversational Chatbot UX Design: Insights from High School by Suha Khalil Assayed

“…Advancements in state-of-the-art models and algorithms for chatbots have significantly driven the growth and evolution of human–computer interaction (HCI) in recent years. …”
Get full text

ISSP by Zouein, P.P.

“…The underlying algorithms optimize positions of resources by minimizing handling and rehandling costs of these on site. …”
Get full text
Get full text
Get full text

On the complexity of bilinear computations by Takche, Jean Halim

“…One can show that we can restrict ourselves to bilinear algorithms. Brockett and Dobkin showed that the problem is equivalent to minimizing the number of rank one matrices that generate a given set of matrices. …”
Get full text
Get full text
Get full text