Search Results - (( developing merging _ algorithm ) OR ( java optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Energy efficient path reconstruction in wireless sensor network using iPath

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Visdom: Smart guide robot for visually impaired people

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  5. 5
    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

    Published 2012
    “…A series of experiment was carried out by using one computer. Vertex Merge Algorithm (VMA) simulation is developed under Linux platform. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    An improved algorithm for channel allocation on direct sequence spread spectrum

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Welsh Powell algorithm is an algorithm that tries to solve the graph coloring problem.Dsatur algorithm is an algorithm coloring sorted by building sequence of vertices dynamically.However,these algorithms have its weaknesses in terms of the minimum number of channel required.In this study,channel allocation called Vertex Merge Algorithm (VMA) is proposed with aim to minimize number of required channels.It is based on the logical structure of vertex in order to a coloring the graph.Each vertex on the graph arranged based on decreasing number of degree.The vertex in the first place on the set gives a color,and then this vertex is merged with non-adjacent vertex.This process is repeatedly until all vertices colored.The assignment provides a minimum number of channels required.A series of an experiment was carried out by using one computer.Vertex Merge Algorithm (VMA) simulation is developed under Linux platform.It was carried out in Hypertext Preprocessor (PHP) programming integrated with GNU Image Manupulation Program (GIMP) for open and edit image.The experimental results show that the proposed algorithm work successfully in channel allocation on DSSS with the minimum of channels required.The average percentage reduction in the number of required channels among the VMA, Dsatur algorithm and Welsh Powell algorithm in the simple graph is equivalent to 0.0%. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Development of web based learning content of animation algorithm on searching and sorting techniques / Nur Linda Abdi Nur

    Development of web based learning content of animation algorithm on searching and sorting techniques / Nur Linda Abdi Nur by Abdi Nur, Nur Linda

    Published 2007
    “…In sorting algorithm, we focused on quick sort, heap sort, merge sort, bubble sort, insertion sort and selection sort while in searching algorithm we focused on binary search and sequential search. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Join query enhancement processing (jqpro) with big rdf data on a distributed system using hashing-merge join technique

    Join query enhancement processing (jqpro) with big rdf data on a distributed system using hashing-merge join technique by Nahla Mohammedelzein, Elawad Babiker

    Published 2021
    “…Both processes were sorted by algorithms on join attributes and the sorted relations was merged. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Development Of Hierarchical Skin-Adaboost-Neural Network (H-Skann) For Multiface Detection In Video Surveillance System

    Development Of Hierarchical Skin-Adaboost-Neural Network (H-Skann) For Multiface Detection In Video Surveillance System by Zakaria, Zulhadi

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    DNA Motif Prediction using Novel Ensemble Approach

    DNA Motif Prediction using Novel Ensemble Approach by Choong, Allen Chieng Hoon

    Published 2020
    “…Then, using a proposed merging algorithm, the candidate motifs are merged regardless the different lengths. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Ensemble Framework for Motif Discovery Based on Data Partitioning

    Ensemble Framework for Motif Discovery Based on Data Partitioning by Choong, Allen Chieng Hoon

    Published 2020
    “…Then, using a proposed merging algorithm, the candidate motifs are merged regardless the different lengths. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    JQPro : Join query processing in a distributed system for big RDF data using the hash-merge join technique

    JQPro : Join query processing in a distributed system for big RDF data using the hash-merge join technique by Elzein, Nahla Mohammed, Mazlina, Abdul Majid, Hashem, Ibrahim Abaker Targio, Ashraf Osman, Ibrahim, Abulfaraj, Anas W., Binzagr, Faisal

    Published 2023
    “…By adopting a MapReduce framework in JQPro, we developed three new algorithms, which are hash-join, sort-merge, and enhanced MapReduce-join for join query processing of RDF data. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    JQPro : Join query processing in a distributed system for big RDF data using the hash-merge join technique

    JQPro : Join query processing in a distributed system for big RDF data using the hash-merge join technique by Elzein, Nahla Mohammed, Mazlina, Abdul Majid, Hashem, Ibrahim Abaker Targio, Ashraf Osman, Ibrahim, Abulfaraj, Anas W., Binzagr, Faisal

    Published 2023
    “…By adopting a MapReduce framework in JQPro, we developed three new algorithms, which are hash-join, sort-merge, and enhanced MapReduce-join for join query processing of RDF data. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    New Learning Models for Generating Classification Rules Based on Rough Set Approach

    New Learning Models for Generating Classification Rules Based on Rough Set Approach by Al Shalabi, Luai Abdel Lateef

    Published 2000
    “…Two different models for learning in data sets were proposed based on two different reduction algorithms. The split-condition-merge-reduct algorithm ( SCMR) was performed on three different modules: partitioning the data set vertically into subsets, applying rough set concepts of reduction to each subset, and merging the reducts of all subsets to form the best reduct. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    An efficient virtual tour : a merging of path planning and optimization

    An efficient virtual tour : a merging of path planning and optimization by Abd Latiff, Muhammad Shafie, Hassan, Rohayanti

    Published 2004
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications

    Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications by Teo, Chee Huat

    Published 2016
    “…This thesis will present the design, development and analysis of performance on a developed Double Stage Filter (DSF) algorithm and other existing stereo matching algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    MuDi-Stream: A multi density clustering algorithm for evolving data stream

    MuDi-Stream: A multi density clustering algorithm for evolving data stream by Amini, A., Saboohi, H., Herawan, T., Teh, Y.W.

    Published 2016
    “…Recently, a number of density-based algorithms have been developed for clustering data streams. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    JQPro: Join query processing in a distributed system for Big RDF data using the hash-merge join technique

    JQPro: Join query processing in a distributed system for Big RDF data using the hash-merge join technique by Nahla Mohammed Elzein, Mazlina Abdul Majid, Ibrahim Abaker Targio Hashem, Ashraf Osman Ibrahim Elsayed, Anas W. Abulfaraj, Faisal Binzagr

    Published 2023
    “…By adopting a MapReduce framework in JQPro, we developed three new algorithms, which are hash-join, sort-merge, and enhanced MapReduce-join for join query processing of RDF data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Meta-heuristic structure for multiobjective optimization case study: Green sand mould system

    Meta-heuristic structure for multiobjective optimization case study: Green sand mould system by Ganesan, T., Elamvazuthi, I., KuShaari, K.Z., Vasant, P.

    Published 2014
    “…In this chapter, an approach that merges meta-heuristic algorithms with the weighted sum method is introduced. …”
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  20. 20
    Simulation of droplet coalesce using lattice Boltzmann method

    Simulation of droplet coalesce using lattice Boltzmann method by Mohamad Rizam, Zenudin

    Published 2009
    “…The two droplets will merge together until steady state and become one big droplet.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:

Search Tools: