Using Fractional Bernoulli Wavelets for Solving Fractional Diffusion Wave Equations with Initial and Boundary Conditions by Sahlan, Monireh Nosrati

Get full text

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

“…The CEN algorithm integrates the convex-hull property and elastic net algorithm to generate an initial tour for the E-TSP. The NII algorithm uses two rearrangement operators to improve the initial tour given by the CEN algorithm. …”
Get full text
Get full text

Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities by Zouein, P. P.

“…In most problems considered where the total-objects-to-site-area ratio did not exceed 60%, the algorithm returned close to optimal solutions in a reasonable time.…”
Get full text
Get full text
Get full text

Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

“…The GA method is implemented in java, and the improvement of the initial solution is exhibited by the results of the experiments based on the specified constraints and requirements.…”
Get full text
Get full text
Get full text
Get full text

Numerical Solution for a Controlled Nonconvex Sweeping Process by Nour, Chadi

“…A numerical method and the theory leading to its success are developed in this letter to solve nonstandard optimal control problems involving sweeping processes, in which the sweeping set C is non-convex and coincides with the zero-sublevel set of a smooth function having a Lipschitz gradient, and the fixed initial state is allowed to be any point of C. …”
Get full text
Get full text
Get full text
Get full text

A Fast Convergent Homotopy Perturbation Method for Solving Selective Harmonics Elimination PWM Problem in Multi Level Inverter by Salman Ahmad (7170104)

“…In this paper, a novel fast convergent homotopy perturbation method (HPM) is proposed to compute switching angles for a multilevel inverter at a faster rate. The solutions obtained by the proposed technique is as accurate as obtained by the algebraic methods with no dependency on the initial guess. …”

Effective solutions for the split delivery vehicle routing problem with time windows by Harmanani, Haidar

Get full text
Get full text
Get full text

Investigating students' approval of a geometrical approach to differential equations and their solutions by Habre, Samer

Get full text
Get full text
Get full text

Laplace Adomian Solutions to Fractional Differential Equations that Arise in Natural Science and Engineering Applications by Rabah, Fatima H.

Get full text

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

Mathematical modeling and numerical analysis for the higher order Boussinesq system by Khorbatly, Bashar

“…Providing an existence and uniqueness of solution on a relevant time scale of order 1/√ε and showing that the solution’s behavior is close to the solution of the water waves equations with a better precision corresponding to initial data, the asymptotic model is well-posed in the sense of Hadamard. …”
Get full text
Get full text
Get full text
Get full text

On the Computations of Gas-Solid Mixture Two-Phase Flow by Touma, R.

“…This solution is then employed in the construction of upwind Godunov methods to solve the general initial-boundary value problem for the two-phase gas-solid mixture. …”
Get full text
Get full text
Get full text

A combinatorial auction‐based approach for ridesharing in a student transportation system by Chefi Triki (14158860)

“…A hybrid heuristic-based optimization framework, that takes advantage of meta-heuristic algorithms to improve an initial solution, is also developed to solve large-sized instances of the problem. …”

UAV Trajectory Planning for Data Collection from Time-Constrained IoT Devices by Samir, Moataz

“…The formulated optimization problem is shown to be mixed integer non-convex and generally NP-hard. To solve it, we first propose the high-complexity branch, reduce and bound (BRB) algorithm to find the global optimal solution for relatively small scale scenarios. …”
Get full text
Get full text
Get full text
Get full text

Spreading of oil on water in the surface-tension regime by Chebbi, Rachid

“…Using the asymptotic solutions to initiate integration, the differential equations for the oil thickness, oil velocity, and boundary-layer profiles are integrated starting from the leading edge and bulk boundary, which after matching provide a complete solution. …”
Get full text

Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm by Nasser, Youssef

“…The objective is to produce a model capable of predicting centroids with greater accuracy than the traditional random initialization used in K-means. Experimental results indicate that the proposed method outperforms random initialization in terms of the number of iterations required to achieve an optimal solution.…”
Get full text
Get full text
Get full text

Artificial neural network algorithms. (c1999) by Ramadan, Samer N.

Get full text
Get full text

Salp swarm algorithm: survey, analysis, and new applications by Abualigah, Laith

“…These two algorithms are put to test on a variety of mathematical optimization functions to see how they behave when it comes to finding the best solutions to optimization problems. The results of the mathematical functions reveal that the SSA technique may improve the initial random solutions more effectively and efficiently. …”
Get full text

MoveSchedule by Zouein, Pierette

“…MoveSchedule solves a constrained dynamic layout problem with the objective of minimizing resource transportation and relocation costs. …”
Get full text
Get full text
Get full text

Multi-Classifier Tree With Transient Features for Drift Compensation in Electronic Nose by Atiq Ur Rehman (8843024)

“…In this paper, these two problems of `sensors long term drift' and `delayed response' are solved simultaneously to propose a robust and fast electronic nose system, with following merits: (i) only initial transient state features are used in the proposed system without waiting for the sensors to reach a steady state, (ii) a modified boxplot approach is used to handle noisy/drifted data points as a preprocessing step before the classification setup, (iii) a heuristic tree classification approach with optimized transient features is proposed, (iv) the proposed approach only relies on adapted ML methods contrary to the traditional approaches like system recalibration or sensors replacement for handling sensors drift, and (v) the proposed ML model does not require any target domain data and uses only the source domain data for learning the classifier, opposed to the other ML solutions available in the existing literature. …”