A method for data path synthesis using neural networks by Harmanani, H.

“…The method is based on the modified Hopfield neural network model of computation and the McCulloch-Pitts binary neuron model. The proposed algorithm has a running time complexity of O(1) for a neural network with n vertices and c cliques. …”
Get full text
Get full text
Get full text
Get full text

Rate Adaptation in Dynamic Adaptive Video Streaming Over HTTP by Abdelhafez, Nada

Get full text

An Adaptive Joint Sparsity Recovery for Compressive Sensing Based EEG System by Hamza Djelouat (14603379)

“…In addition, the paper exploits the joint sparsity of multichannel EEG using subspace pursuit (SP) algorithm as well as a designed sparsifying basis in order to improve the reconstruction quality. …”

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

“…The complexity of the proposed algorithm is polynomial time, and it is O(n6 L) for matching graphs of size n. …”
Get full text

Neural Networks as a Convex Problem by Khalil, Baha

Get full text

Newton-Raphson based adaptive inverse control scheme for tracking of nonlinear dynamic plants by Shafiq, M.

“…The use of U-model alleviates the computational complexity of the nonlinear controller design that occurs when using other modelling frame works such as NARMAX model. …”
Get full text
Get full text

On end-to-end scheduling in wireless cellular networks by Saad, Walid

“…Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. …”
Get full text
Get full text
Get full text
Get full text

Impact of Charging Electric Vehicles under Different State of Charge Levels and Extreme Conditions by Claude Ziad El-Bayeh (17542284)

“…Once these constraints are violated, the optimization algorithm might not work correctly and might not converge to a feasible solution, especially when the complexity of the system increases and includes nonlinearities. …”

Maximum common induced subgraph parameterized by vertex cover by Abu-Khzam, Faisal N.

“…In this paper we prove constructively that MCIS is fixed-parameter tractable when parameterized by the vertex cover numbers of the input graphs. Our algorithm is also an improved exact algorithm for the problem on instances where the minimum vertex cover is small compared to the order of input graphs.…”
Get full text
Get full text
Get full text

A utility minimization approach for energy-aware cooperative content distribution with fairness constraints by Yaacoub, Elias

“…Thus, to ensure fairness in energy consumption, a low complexity utility minimization algorithm is proposed. …”
Get full text
Get full text
Get full text

A hybrid EDF/FIFO queue for efficient real time flow handling by Fawaz, W.

“…In an attempt to meet the stringent time constraints of real time flows, several scheduling algorithms have been proposed in the literature. Among such algorithms, the so-called EDF algorithm is widely known for its optimal management of flows with strict time constraints, when compared with the standard FIFO algorithm. …”
Get full text
Get full text
Get full text
Get full text

A novel approach for real time flows scheduling by Fawaz, W.

“…However, EDF is complex and expensive as far as implementation is concerned, especially when compared with the standard FIFO algorithm. …”
Get full text
Get full text
Get full text
Get full text

Joint distributed synchronization and positioning in UWB ad hoc networks using TOA by Denis, B.

“…Finally, the proposed distributed maximum log-likelihood algorithm proves to preserve a reasonable level of complexity in each node by approximating asynchronously the positive gradient direction of the log-likelihood function. …”
Get full text
Get full text
Get full text

An Artificial Intelligence Approach for Predictive Maintenance in Electronic Toll Collection System by Alkhatib, Osama

“…Meaning no “perfect” machine learning algorithm that will produce good results at particular problem, in fact for each type of problem a specific algorithm is suited and might achieves good outcome, while another algorithm fails heavily. …”
Get full text

Failure recovery in wireless content distribution networks with device-to-device cooperation by Sharafeddine, Sanaa

“…We present results for various network scenarios using simulations and experimental test bed to demonstrate the effectiveness of the proposed algorithms in terms of performance efficiency, computational complexity, and practical implementation feasibility.…”
Get full text
Get full text
Get full text
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

Towards a Unified Arabic Government Services Chatbot Based on Ontology by Areed, Sufyan

“…Furthermore, a chatbot response algorithm is proposed to respond to government services queries through a hybrid of three different approaches that were executed in a pipeline fashion based on the query complexity. …”
Get full text

A nash bargaining solution for energy-efficient content distribution over wireless networks with mobile-to-mobile cooperation by Yaacoub, Elias

“…Furthermore, a low complexity utility minimization algorithm is presented. …”
Get full text
Get full text
Get full text
Get full text

Joint computing, communication and cost-aware task offloading in D2D-enabled Het-MEC by Abbas, Nadine

“…We formulate and solve the optimal allocation strategy then decompose the problem into two sub-problems in an attempt to reduce its complexity. Furthermore, we propose a low-complexity algorithm that generates high performance results and can be applied for large-scale networks. …”
Get full text
Get full text
Get full text
Get full text

Blood Glucose Regulation Modelling and Intelligent Control by Nasar, Nabeel

Get full text