Search Results - (( developing consumer path algorithm ) OR ( java estimation using algorithm ))

Refine Results
  1. 1

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Software testing is an important step in the software development process, accounting for more than 50% of software development cost as it is laborious and time-consuming. …”
    Get full text
    Get full text
    Indexed Article
  2. 2

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…This project includes the modification of main algorithm which has been implemented in the prototype development. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…Therefore,by determining the shortest path will help in reducing the time consume problem.This project is developed by starting with designing the workflow diagram as well as the design of the output interface.The work flow is the guide for the process of development.In between,Heuristic Approach is used to determine the entire possible paths at first,then Ant Colony Optimization algorithm will be implemented to search for the final and the shortest path. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  4. 4

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Student Project
  7. 7
  8. 8

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…Software testing consumes half of the entire software development cost where test case generation is the most cost consuming activity in the whole process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Simulation of identifying shortest path walkway using particle swarm optimization (PSO) by Kae Shin, Yong

    Published 2012
    “…Therefore, this project is develop to find the shortest path which means to find a path with minimum distance between two locations by apply the algorithm of Particle Swarm Optimization technique.This system is expected to solve the shortest path and identify the optimal path.Due to this,it is tend to reduce the time consume in specific situation with the determining of shortest path. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  10. 10
  11. 11

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    “…For the path metric updater unit (PMU), the traditional method of Viterbi algorithm is to store the selected minimum value of branch metric in the memory unit. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

    Published 2007
    “…The most probable match is selected and returned as estimated location based on Bayesian filtering algorithm. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Published 2012
    “…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 other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
  14. 14
  15. 15

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Therefore, it is mandatory to test all possible functional paths of the software exhaustively. Exhaustive testing is costly and time consuming and with the higher number of inputs, the number of test cases increases exponentially. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Predetermined path of mobile data gathering in wireless sensor networks based on network layout by Ghaleb, Mukhtar, Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2014
    “…The ME will select a centroid point between two sub-polling points, subsequently selecting common turning points as the core of the basis of the tour path. Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. …”
    Get full text
    Get full text
    Article
  17. 17

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

    Published 2011
    “…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
  18. 18

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion 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 other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  19. 19

    Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm by Arezoumand, Reza

    Published 2015
    “…Developing an exploration algorithm based on spanning tree is the main contribution. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Estimation of dielectric constant for various standard materials using microstrip ring resonator by Low, Pek Jin, Esa, Fahmiruddin, You, Kok Yeow, Abbas, Zulkifly

    Published 2017
    “…The differences in frequency shift were used in NetBeans IDE 8.1 algorithm of Java for dielectric constant calculation. …”
    Get full text
    Get full text
    Article