Efficient Solvers For Image Dublurring Problem And Stochastic Darcy’s Equations by unknown

Get full text

Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. …”
Get full text
Get full text

An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem by Bendaya, M.

“…In this paper, an efficient tabu search algorithm is prepared ibr solving the singlemachine mean tardiness problem. …”
Get full text

Efficient methods and techniques for the open-shop scheduling problem. (c2006) by Bou Ghosn, Steve

Get full text
Get full text

An efficient method for the open-shop scheduling problem using simulated annealing by Harmanani, Haidar M.

“…The method is based on a simulated annealing algorithm that efficiently explores the solution space. The method was implemented and tested on various benchmark problems in the literature. …”
Get full text
Get full text
Get full text
Get full text

A study on the major problem areas in managing the portfolio and their impact on the efficiency of the PPM by Mubarak, Alia Marjan

“…The aim of this research is to investigate general problem areas in the Project Portfolio management, and to focus in depth on the determinants that affect the efficiency of PPM in terms of project based organization in Dubai Government. …”
Get full text

Energy systems and the knowledge problem by Ammous, Saifedean H.

Get full text
Get full text
Get full text
Get full text

The maximum common subgraph problem by Abu-Khzam, Faisal N.

“…In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. …”
Get full text
Get full text
Get full text
Get full text

Exercisability Randomization of the American Option by Leduc, Guillaume

“…The valuation of American options is an optimal stopping time problem which typically leads to a free boundary problem. …”
Get full text

Kernelization algorithms for the vertex cover problem by Abu-Khzam, Faisal N.

“…A variety of efficient kernelization strategies for the classic vertex cover problem are developed, implemented and compared experimentally. …”
Get full text
Get full text
Get full text

Complexities of special matrix multiplication problems by Takche, J.

Get full text
Get full text
Get full text
Get full text

Scalable Parallel Algorithms for FPT Problems by Abu-Khzam, Faisal N.

“…Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems of significance. As a case study, optimal solutions to very large instances of the NP-hard vertex cover problem are computed. …”
Get full text
Get full text
Get full text

On the steiner walk problem. (c2009) by Maarouf, Amina

Get full text
Get full text

On the parameterized parallel complexity and the vertex cover problem by Abu-Khzam, Faisal N.

“…Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. …”
Get full text
Get full text
Get full text
Get full text

A clustering metaheuristic for large orienteering problems by Almiqdad Elzein (13141038)

“…The metaheuristic starts by decomposing the problem into smaller, independent sub-problems that are efficiently solved using an algorithm of choice, sequentially or in parallel. …”

Effective solutions for the capacitated vehicle routing problem and for the split delivery vehicle routing problem with time windows. (c2013) by Hilal, Nathalie

Get full text
Get full text

COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM by Bendaya, M.

“…In this paper, we compare recent efficient heuristics proposed for solving the joint replenishment problem. …”
Get full text

Scalable parallel algorithms for difficult combinatorial problems by Abu-Khzam, Faisal N.

“…These complementary tools and technologies are used to launch systematic attacks on combinatorial problems of significance. As a case study, optimal solutions to very large instances of the NP-hard vertex cover problem are computed. …”
Get full text
Get full text
Get full text

Starvation Problem in CPU Scheduling for Multimedia Systems by Salah, Khaled

Get full text

Improving the Classification of Multiple Disorders with Problem Decomposition by Abdel-Aal, Radwan E.

“…The problem decomposition approach helps plan more efficient diagnostic tests and provides improved support for the decision making process. …”
Get full text