Search Results - (( developing consumer path algorithm ) OR ( java application stemming algorithm ))

Search alternatives:

Refine Results
  1. 1
    Automated path testing using the negative selection algorithm

    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
    Save to List
    Saved in:
  2. 2
    Shortest Path Trajectory System Based on Dijkstra Algorithm

    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
    Save to List
    Saved in:
  3. 3
    Simulation of identifying shortest path walkway in library by using ant colony optimization

    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
    Save to List
    Saved in:
  4. 4
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    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
    Save to List
    Saved in:
  5. 5
    Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.]

    Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.] by Nasrudin, Nur Hasni, Nasaruddin, Siti Hajar, Syed Abdul Halim, Syarifah Syafiqah Wafa, Ahmad Junid, Rosida

    Published 2015
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    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
    Save to List
    Saved in:
  7. 7
    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    “…Path planning is one of the issues to be handled in the development of autonomous systems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

    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
    Save to List
    Saved in:
  9. 9
    Simulation of identifying shortest path walkway using particle swarm optimization (PSO)

    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
    Save to List
    Saved in:
  10. 10
    Test case minimization applying firefly algorithm

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Development of low power viterbi decoder on complex programmable logic device platform

    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
    Save to List
    Saved in:
  12. 12
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    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
    Save to List
    Saved in:
  13. 13
    Predetermined path of mobile data gathering in wireless sensor networks based on network layout

    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
    Save to List
    Saved in:
  14. 14
    Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm

    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
    Save to List
    Saved in:
  15. 15
    Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system

    Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah, Marhaban, Mohammad Hamiruce

    Published 2016
    “…Developing an exploration algorithm based on spanning tree is the main contribution and this exploration algorithm is performing fast localization of sensor nodes in energy efficient manner. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine

    Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine by Jalaluddin, Mohammad Fariduddin, Kamaru-Zaman, Ezzatul Akmal, Abdul Rahman, Shuzlina, Mutalib, Sofianita

    Published 2017
    “…This study developed Courier Delivery Services Visualisor (CDSV) that is able to visualize the best route to be taken by distributor, so that the courier service can arrive on time.CDSV employed Genetic Algorithm (GA) and Astar Algorithm (A*) that integrates with Geographical Information System (GIS) data.A graphical user interface in the form of simulation map that suggests the best route and the optimal distance are displayed for easier courier service distribution references.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    A genetic algorithm for management of coding resources in VANET

    A genetic algorithm for management of coding resources in VANET by Lee, Chun Hoe, Lim, Kit Guan, Min Keng Tan, Renee Ka Yin Chin, Kenneth Tze Kin Teo

    Published 2017
    “…Therefore, GA based network routing (GANeR) is embedded into network to search for shortest path from the source to the destination. It showed that the developed GANER in this work provides a better route with coding opportunities and reduces energy consumption in the network. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Evolutionary algorithm based network coding for optmization of intelligent vehicular ad hoc network

    Evolutionary algorithm based network coding for optmization of intelligent vehicular ad hoc network by Lee, Chun Hoe

    Published 2017
    “…It showed that the developed GA-PSO in this work provides a better route with coding opportunities and reduces energy consumption in the network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Intelligent guidance parking system using modified Dijkstra's algorithm

    Intelligent guidance parking system using modified Dijkstra's algorithm by Jaafar, Haslina, Zabidi, Muhamad Hidayat, Che Soh, Azura, Thong, Peng Hoong, Shafie, Suhaidi, Ahmad, Siti Anom

    Published 2014
    “…The best parking system is the system that provides customers the ease of finding the available spaces, user friendly and less time consuming. This paper presents the intelligent parking system which apply Dijkstra’s algorithm in finding the shortest path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Evolutionary algorithm based network coding for optimization of intelligent vehicular ad hoc network

    Evolutionary algorithm based network coding for optimization of intelligent vehicular ad hoc network by Lee, Chun Hoe

    Published 2017
    “…It showed that the developed GA-PSO in this work provides a better route with coding opportunities and reduces energy consumption in the network. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: