Search Results - (( basic complex ((ant algorithm) OR (path algorithm)) ) OR ( java implication based algorithm ))

  • Showing 1 - 11 results of 11
Refine Results
  1. 1

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  2. 2
  3. 3
  4. 4

    The design and applications of the african buffalo algorithm for general optimization problems by Odili, Julius Beneoluchi

    Published 2017
    “…Some of the successfully designed stochastic algorithms include Simulated Annealing, Genetic Algorithm, Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, Artificial Bee Colony Optimization, Firefly Optimization etc. …”
    Get full text
    Get full text
    Thesis
  5. 5

    IMPLEMENTATION OF BEHAVIOUR BASED NAVIGATION IN A PHYSICALLY CONFINED SITE by ABDUL RAZAK, NUSRAH

    Published 2017
    “…Selected basic behaviour-based algorithms such as wallfollower, obstacle avoidance, escape route and target detection are to be combined and its efficiency is measured. …”
    Get full text
    Get full text
    Final Year Project
  6. 6

    Neural Network – A Black Box Model by Kuok, Kuok King, Chan, Chiu Po, Md. Rezaur, Rahman, Khairul Anwar, Mohamad Said, Chin Mei, Yun

    Published 2024
    “…A variety of metaheuristic algorithms have been used to train ANN, including Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Ant Colony Optimization (ACO), Tabu Search (TS), and Harmony Search (HS). …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  7. 7
  8. 8

    Unconstraint assignment problem : a molecular computing approach by Zuwairie, Ibrahim, Yusei, Tsuboi, Osamu, Ono, Marzuki, Khalid

    Published 2006
    “…On the other hand, for the computational phase, itis discovered that the complexity of the unconstraint assignment problem can be reduced to a path problem of a graph, and thepossibility to solve the unconstraint assignment problem by DNA computing approach is shown in detail.…”
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Enhanced Mobility Solution In Mobile Ipv6 Network by David, Adeniji Oluwashola

    Published 2008
    “…Enhanced Mobility Solution in Mobile IPv6 Network is extremely complex; the study addressed the multihoming issues of MIPV6 Networks on the basis of NEMO Basic Support, analyzes the benefits of multihoming and discusses implementation issues of all classes of multihoming possibilities. …”
    Get full text
    Get full text
    Thesis
  11. 11