Three-phase simulated annealing algorithms for exam scheduling حسب Mansour, Nashat

"…We decompose the problem into three phases and propose simulated annealing algorithms for these phases. Hence, we refer to our solution methods as 3-phase simulated annealing (3PSA). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Parallel Algorithms for Distinguishing Nondeterministic Finite State Machines حسب Ali, Mustafa

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

Algorithmic Study of Online Multi-Facility Location Problems حسب Markarian, Christine

"…The latter is a worst-case analysis that compares the cost of the online algorithm to that of the optimal offline algorithm that is assumed to know all demands in advance. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

An Algorithm For Computing The Distance Between Two Circular Disks حسب Almohamad, H.A.

"…For the case where the points are at the circumferences, the problem has no analytical solutions [IBM J. Res. Develop. 34 (5) (1990)]. Instead, we propose for the latter case an iterative algorithm based on computing the distance between a fixed point and a circle. …"
احصل على النص الكامل

A hybrid genetic algorithm for task allocation in multicomputers حسب Mansour, Nashat

"…A hybrid genetic algorithm for the task allocation problem (HGATA) in multicomputers is presented. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A genetic algorithm approach for regrouping service sites حسب Mansour, Nashat

"…We propose a two-phase method, based on a weighted-graph problem formulation, for providing good suboptimal solutions. In the first phase, the graph is decomposed into the required number of subgraphs (regions) using a tuned hybrid genetic algorithm. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Auto Takeoff and Precision Landing using Integrated GPS/INS/Optical Flow Solution حسب Al-Sharman, Mohammad Khaled Salameh

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

Multiclass feature selection with metaheuristic optimization algorithms: a review حسب Abu Zitar, Raed

"…Metaheuristic algorithms have also been presented in four primary behavior-based categories, i.e., evolutionary-based, swarm-intelligence-based, physics-based, and human-based, even though some literature works presented more categorization. …"
احصل على النص الكامل

Proactive machine learning-based solution for advanced manageability of multi-persona mobile computing حسب Tout, Hanine

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

The effect of different stopping criteria on multi-objective optimization algorithms حسب Abu Doush, Iyad

"…Evolutionary multi-objective optimization (EMO) refers to the domain in which an evolutionary algorithm is applied to tackle an optimization problem with multiple objective functions. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

The effect of different stopping criteria on multi-objective optimization algorithms حسب El-Abd, Mohammed

"…Evolutionary multi-objective optimization (EMO) refers to the domain in which an evolutionary algorithm is applied to tackle an optimization problem with multiple objective functions. …"
احصل على النص الكامل
احصل على النص الكامل

Genetic and heuristic algorithms for regrouping service sites. (c2000) حسب Tabbara, Hiba

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

Time-varying volatility model equipped with regime switching factor: valuation of option price written on energy futures حسب Leduc, Guillaume

"…To determine the parameters of the regime switching model and identify when economic states change, we employ the EM algorithm, utilizing real gas futures price data. We validate our closed-form solution for the option pricing through simulations employing the generalized antithetic variates Monte-Carlo technique. …"
احصل على النص الكامل

An intensive and comprehensive overview of JAYA algorithm, its versions and applications حسب Abou Doush, Iyad

"…The JAYA algorithm combines the survival of the fittest principle from evolutionary algorithms as well as the global optimal solution attractions of Swarm Intelligence methods. …"
احصل على النص الكامل
احصل على النص الكامل

Parallel physical optimization algorithms for allocating data to multicomputer nodes حسب Mansour, Nashat

"…The parallel genetic algorithm (PGA) is based on a natural model of evolution. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Scatter search algorithm for the cross-dock door assignment problem حسب Tarhini, Abbas

"…In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Natural optimization algorithms for the cross-dock door assignment problem حسب Tarhini, Abbas A.

"…This paper modifies a classical mathematical model that represents the CDAP and implements an evolutionary metaheuristic SS algorithm and tests it and then compares the results with those of another evolutionary algorithm, i.e., genetic algorithm (GA). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Physical optimization algorithms for mapping data to distributed-memory multiprocessors حسب Mansour, Nashat

"…An important feature of these algorithms is that they deviate from the operation of their sequential counterparts in order to achieve reasonable speed-ups and, yet, they maintain similar solution qualities. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Using genetic algorithms to optimize software quality estimation models حسب Azar, Danielle

"…This thesis explores the use of genetic algorithms for the problem of optimizing existing rule-based software quality estimation models. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A fast exact sequential algorithm for the partial digest problem حسب Mostafa M. Abbas (17058093)

"…The algorithm is able to find all possible solutions for the input and works by traversing the solution tree with a breadth-first search in two stages and deleting all repeated subproblems. …"