Search Results - (( consumer optimization path algorithm ) OR ( java application using algorithm ))

Search alternatives:

Refine Results
  1. 1
    Optimization of multi-holes drilling path using particle swarm optimization

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2018
    “…PSO is also compared with another algorithm like Whale Optimization Algorithm, Ant Lion Optimizer, Dragonfly Algorithm, Grasshopper Optimization Algorithm, Moth-flame Optimization and Sine Cosine Algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  2. 2
    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
    “…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  3. 3
    Optimal path planning algorithms in virtual environments

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…The main aim of the research was to find an efficient route tour approach that combines path finding, path planning and path optimization algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    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 Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
    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 Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    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
    “…Optimal means that the resulting path has minimal length hence the total consumed energy by the agents is the least. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization

    Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization by Pang, Jia Hong

    Published 2011
    “…This research work involves the implementation of Single Objective Genetic Algorithm (SOGA) and Multi-objectives Genetic Algorithm (MOGA) in a 16-point Radix-4 Single Path Delay Feedback (R4SDF) pipelined Fast Fourier Transform (FFT) processor. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    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
    “…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Test case minimization applying firefly algorithm

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

    Published 2018
    “…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak

    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak by Abdul Razak, Noorfadzli

    Published 2018
    “…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Literature Review of Optimization Techniques for Chatter Suppression In Machining

    Literature Review of Optimization Techniques for Chatter Suppression In Machining by A. R., Yusoff, Mohamed Reza Zalani, Mohamed Suffian, Mohd Yusof, Taib

    Published 2011
    “…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  15. 15
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Energy-efficient scalable routing protocol based on ACO for WSNS

    Energy-efficient scalable routing protocol based on ACO for WSNS by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2019
    “…An energy-efficient scalable routing algorithm based on ant colony optimization (ACO) for WSNs is presented here to find the optimal path of data transmission while consuming less energy leading to increase of network’s lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  17. 17
    Provider independent cryptographic tools

    Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

    Published 2003
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  18. 18
    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
    “…The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Improving Network Consistency and Data Availability Using Fuzzy C Mean Clustering Algorithm in Wireless Sensor Networks

    Improving Network Consistency and Data Availability Using Fuzzy C Mean Clustering Algorithm in Wireless Sensor Networks by Mujahid Tabassum

    Published 2024
    thesis::doctoral thesis
    Save to List
    Saved in:
  20. 20
    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: