Search Results - (( basic complex path algorithm ) OR ( java application optimisation algorithm ))

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
  2. 2

    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
  3. 3

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…The system is essentially a three-part development, utilising Android, Java Servlets, and Arduino platforms to create an optimised and automated urban-gardening system. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  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
  7. 7

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…Finally, the developed expert system was deployed over the internet with central interactive interface from the server as a web-based application. As Java is platform independent and easy to be deployed in web based application and accessible through the World Wide Web (www), this expert system can be one stop application for materials selection.…”
    Get full text
    Get full text
    Thesis
  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

    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