Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine by Duffuaa, S. O.

“…In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. …”
Get full text

On Single Source Reachability Improvement by Alkak, Hashem

“…We show the NP­ hardness and present an effective polynomial-time greedy algorithm. Experimental evaluation of our greedy algorithm is conducted on randomly generated graphs, using the Erdos-Renyi approach. …”
Get full text
Get full text
Get full text

Shuffled Linear Regression with Erroneous Observations by Saab, Samer S.

“…This paper tackles this problem in its full generality using stochastic approximation, which is based on a first-order permutation-invariant constraint. …”
Get full text
Get full text
Get full text
Get full text

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

“…The U-model is utilized to design an adaptive inverse controller by using a simple root-solving algorithm of Newton-Raphson. The synergy of U-model with AIC structure has provided an effective and straight forward method for adaptive tracking of nonlinear plants. …”
Get full text
Get full text

Unit commitment by tabu search by Mantawy, A.H.

“…The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. …”
Get full text
Get full text

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

Get full text
Get full text

Implementation of a Multivariable Modular Structure for Fuzzy Taxi Scheduling System (FTSS) by Kouatli, Issam

“…This paper describes the implementation of a hybridized intelligent algorithm to reach a decision under uncertainty and to tune the possible solution using genetic algorithm. …”
Get full text
Get full text
Get full text
Get full text

Identification of errors-in-variables model with observation outliers based on Minimum-Covariance-Determinant by ALMutawa, J.

“…In order to solve the MCD problem for the EIV model we propose a random search algorithm. …”
Get full text
Get full text

Resource Optimization for 3D Video SoftCast with Joint Texture/Depth Power Allocation by Saqr Khalil Saeed Thabet (19517560)

“…Next, the three-dimensional target distortion problem is divided into two subproblems. In the power-distortion problem, to obtain a target distortion, the algorithm exhaustively solves the closed form of the power resource under a predefined upper-bound bandwidth. …”

Mapping realistic data sets on parallel computers by Mansour, N.

“…They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. …”
Get full text
Get full text
Get full text
Get full text

Methods for system-on-chip test design, scheduling and optimization. (c2006) by Farah, Rana

Get full text
Get full text

How much is location information worth? by Srour, F. Jordan

Get full text
Get full text
Get full text

Severity-Based Prioritized Processing of Packets with Application in VANETs by Ala Al-Fuqaha (4434340)

“…Although DSRC and WAVE have been adopted as the de facto standards, they do not address all the problems and there is room for improvements. In this study, we propose a generic prioritization and resource management algorithm that can be used to prioritize processing of received packets in vehicular networks. …”

Toward automatic motivator selection for autism behavior intervention therapy by Siyam, Nur

“…We use a Q-learning algorithm to solve the modeled problem. …”
Get full text
Get full text

Tabu search based circuit optimization by Sait, Sadiq M.

“…The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. …”
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. Using the appropriate utilities, the algorithm can be used to implement the optimal greedy energy minimization solution or to ensure different degrees of fairness in energy consumption. …”
Get full text
Get full text
Get full text

High-order parametrization of the hypergeometric-Meijer approximants by Abouzeid M. Shalaby (16329062)

“…<p>In this work, we introduce an extension to the hypergeometric algorithm we developed before for the resummation of divergent series.The extension overcome the time-consuming problem we face in the parametrization process of the hypergeometric approximants. …”

Simulations of the penetration of 6061-T6511 aluminum targets by spherical-nosed VAR 4340 steel projectiles by Warren, Thomas

“…In the context of an analysis code, this approximation eliminates the need for discretizing the target as well as the need for a contact algorithm. Thus, this method substantially reduces the computer time and memory requirements. …”
Get full text
Get full text
Get full text

A simulated annealing-based optimal controller for a three phase induction motor by Mantawy, A.H.

“…Accordingly; the proposed approach is implemented to emulate the structure and hence the characteristics of the optimal controller in spite of the partially known system dynamics, inaccuracy or uncertainties of system parameter. The problem is a hard nonlinear optimization problem in continuous variables. …”
Get full text
Get full text

An evolutionary approach to load balancing parallel computations by Mansour, Nashat

“…It is based on a genetic algorithm that combines a number of design choices in order to ameliorate the problem of premature convergence. …”
Get full text
Get full text
Get full text