Search Results - (( java implementation based algorithm ) OR ( problem solving max algorithm ))

Search alternatives:

Refine Results
  1. 1
    Batch mode heuristic approaches for efficient task scheduling in grid computing system

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…Many algorithms have been implemented to solve the grid scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems

    A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems by Phen, Chiak See

    Published 2010
    Get full text
    Working Paper
    Save to List
    Saved in:
  3. 3
    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    A new minimum pheromone threshold strategy (MPTS) for max-min ant system

    A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

    Published 2009
    “…In recent years, various metaheuristic approaches have been created to solve quadratic assignment problems (QAPs). Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches

    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2015
    “…Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Reactive max-min ant system with recursive local search and its application to TSP and QAP

    Reactive max-min ant system with recursive local search and its application to TSP and QAP by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2016
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…Today, with online marketing, banking, healthcare and other services, even the average householder is aware of encryption. The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  9. 9
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Modern fuzzy min max neural networks for pattern classification

    Modern fuzzy min max neural networks for pattern classification by Al Sayaydeh, Osama Nayel Ahmad

    Published 2019
    “…To build an efficient classifier model, researchers have introduced hybrid models that combine both fuzzy logic and artificial neural networks. Among these algorithms, Fuzzy Min Max (FMM) neural network algorithm has been proven to be one of the premier neural networks for undertaking the pattern classification problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Reactive approach for automating exploration and exploitation in ant colony optimization

    Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

    Published 2016
    “…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function

    A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

    Published 2018
    “…The obtained results demonstrate and verify the effectiveness and robustness of QPSO to solve many-objective EED problems. This also shows that QPSO can effectively be implemented in such power dispatch problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function

    A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

    Published 2018
    “…The obtained results demonstrate and verify the effectiveness and robustness of QPSO to solve many-objective EED problems. This also shows that QPSO can effectively be implemented in such power dispatch problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Automatic Number Plate Recognition on android platform: With some Java code excerpts

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…The main challenges of implementing ANPR algorithm on mobile phone are how to produce a higher coding efficiency, lower computational complexity, and higher scalability. …”
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  16. 16
    An exploration technique for the interacted multiple ant colonies optimization framework

    An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

    Published 2024
    Conference Paper
    Save to List
    Saved in:
  17. 17
    Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework

    Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework by Asaad Aref, Ibrahim

    Published 2004
    “…A design proposal was outlined to provide an adaptive client/server approach to stream audio contents using Real-Time Transport Protocol (RTP) involving architecture based on the Java Media Framework (JMF) Application Programmable Interfaces (API).RTP protocol is the Internet-standard protocol for the transport of real-time data, including audio and video and can be implemented by using Java Media Framework (JMF). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Performance comparison of differential evolution and particle swarm optimization in constrained optimization

    Performance comparison of differential evolution and particle swarm optimization in constrained optimization by Iwan, Mahmud, Akmeliawati, Rini, Faisal, Tarig, Al-Assadi, Hayder M.A.A.

    Published 2012
    “…Optimization appears in many aspects of engineering problems. There are quite numbers of modern optimization algorithms proposed in the last two decades to solve optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Hybrid ant colony optimization for grid computing

    Hybrid ant colony optimization for grid computing by Abdul Nasir, Husna Jamal, Ku-Mahamud, Ku Ruhana

    Published 2009
    “…A hybrid ant colony optimization technique to solve the stagnation problem in grid computing is proposed in this paper.The proposed algorithm combines the techniques from Ant Colony System and Max – Min Ant System and focused on local pheromone trail update and trail limit.The agent concept is also integrated in this proposed technique for the purpose of updating the grid resource table.This facilitates the hybrid ant colony optimization technique in solving the stagnation problem in two ways within one cycle, thus minimize the total computational time of the jobs.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Café Web Based System Using Priority Scheduling Approach

    Café Web Based System Using Priority Scheduling Approach by Fatimah, Ghazali, Rohana, Ismail, Mohamad Hariz, Hasni

    Published 2017
    “…The priority scheduling algorithm is based on Control Processing Unit scheduling algorithm where it has a priority to execute tasks. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: