Efficient Solvers For Image Dublurring Problem And Stochastic Darcy’s Equations حسب unknown

احصل على النص الكامل

Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل

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

"…In this paper, an efficient tabu search algorithm is prepared ibr solving the singlemachine mean tardiness problem. …"
احصل على النص الكامل

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

احصل على النص الكامل
احصل على النص الكامل

An efficient method for the open-shop scheduling problem using simulated annealing حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A study on the major problem areas in managing the portfolio and their impact on the efficiency of the PPM حسب 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. …"
احصل على النص الكامل

Energy systems and the knowledge problem حسب Ammous, Saifedean H.

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

The maximum common subgraph problem حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Exercisability Randomization of the American Option حسب Leduc, Guillaume

"…The valuation of American options is an optimal stopping time problem which typically leads to a free boundary problem. …"
احصل على النص الكامل

Kernelization algorithms for the vertex cover problem حسب Abu-Khzam, Faisal N.

"…A variety of efficient kernelization strategies for the classic vertex cover problem are developed, implemented and compared experimentally. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Complexities of special matrix multiplication problems حسب Takche, J.

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Scalable Parallel Algorithms for FPT Problems حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

On the steiner walk problem. (c2009) حسب Maarouf, Amina

احصل على النص الكامل
احصل على النص الكامل

On the parameterized parallel complexity and the vertex cover problem حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A clustering metaheuristic for large orienteering problems حسب 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) حسب Hilal, Nathalie

احصل على النص الكامل
احصل على النص الكامل

COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM حسب Bendaya, M.

"…In this paper, we compare recent efficient heuristics proposed for solving the joint replenishment problem. …"
احصل على النص الكامل

Scalable parallel algorithms for difficult combinatorial problems حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Starvation Problem in CPU Scheduling for Multimedia Systems حسب Salah, Khaled

احصل على النص الكامل

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

"…The problem decomposition approach helps plan more efficient diagnostic tests and provides improved support for the decision making process. …"
احصل على النص الكامل