Search Results - (( variable iteration method algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Partial Newton methods for a system of equations by Goh, Bean San, Leong, Wah June, Siri, Zailan

    Published 2013
    “…This is because it uses only one or two variables instead of all the search variables in each iteration.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly by Mohd Suzaly, Muhammad Abu Syah

    Published 2023
    “…The next method is simplex method. The simplex method is a conceptual model approach for analysing linear programming problems with any number of variables. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  8. 8

    Comparative study of modified BFGS and new scale modified BFGS for solving unconstrained optimization / Shahirah Atikah Mohamad Husnin by Mohamad Husnin, Shahirah Atikah

    Published 2018
    “…Broyden-Fletcher-Goldfarb-Shanno (BFGS) is one of a well-known Quasi-Newton update formula. This method is generally considered as the most efficient method among other variable metric methods for solving unconstrained optimization problems. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    Model selection approaches of water quality index data by Kamarudin, Nur Azulia, Ismail, Suzilah

    Published 2016
    “…Automatic model selection by using algorithm can avoid huge variability in model specification process compared to manual selection.With the employment of algorithm, the right model selected is then also used for forecasting purposes. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  13. 13

    Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

    Published 2025
    “…The model employs a two-level structure, where the first level uses standard soft constraints as the objective function to evaluate solution quality, while the second level dynamically adapts to faculty-specific preferences. A constructive algorithm was developed to generate an initial feasible solution, which was subsequently refined using two primary approaches to evaluate their efficiency: Iterative Threshold Pipe Variable Neighborhood Descent (IT-PVND), and a modified Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin by Shamsudin, Siti Nur Hafiza

    Published 2019
    “…Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms.…”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Existence and uniqueness for the evolutionary impulse control problem using an asynchronous algorithms by Haiour M., Bencheikh Le Hocine M.E.A., Jan R., Himadan A., Boulaaras S.

    Published 2025
    “…Our approach unfolds through a four-step methodology, leveraging distinctive features of a discrete iterative technique. This methodology integrates semi-implicit techniques with respect to the variable t and employs spatial approximation via finite element methods. …”
    Article
  19. 19

    Towards large scale unconstrained optimization by Abu Hassan, Malik

    Published 2007
    “…This method computes a Newton-type direction by truncating the conjugate Gradient method iterates (inner iterations) whenever a required accuracy is nobtained, thereby the superlinear convergence is guaranteed. …”
    Get full text
    Get full text
    Get full text
    Inaugural Lecture
  20. 20

    Extended multiple models selection algorithms based on iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm by Nur Azulia, Kamarudin

    Published 2019
    “…Therefore, in this study SUREAutometrics is improvised using two MLE methods, which are iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm, named as SURE(IFGLS)-Autometrics and SURE(EM)-Autometrics algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis