Search Results - (( data selection path algorithm ) OR ( java application clustering algorithm ))

Refine Results
  1. 1

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

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  2. 2
  3. 3

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
    Get full text
    Get full text
    Thesis
  4. 4

    An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network by Wan Isni Sofiah, Wan Din, Asyran Zarizi, Abdullah, Razulaimi, Razali, Ahmad Firdaus, Zainal Abidin, Salwana, Mohamad, Eh Phon, Danakorn Nincarean, Cik Feresa, Mohd Foozy

    Published 2019
    “…When this happens, the sensor node cannot receive and send the data until the energy is renewed. To reduce WSN energy consumption, the process of selecting a path to the destination is very important. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…The prototypes will be developed using JAVA language united with a MySQL database. Core functionality of the simulator are job generation, volunteer generation, simulating algorithms, generating graphical charts and generating reports. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9

    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
    “…Thus, within each of these divided areas, the multi-hop collection is deployed as a sub-set to the main collection. 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. …”
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

    Published 2009
    “…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    A Novel Path Prediction Strategy for Tracking Intelligent Travelers by Motlagh, Omid Reza Esmaeili

    Published 2009
    “…The system is then used in path prediction mode for reconstructing the missing parts of the trajectory when actual positioning data is unavailable. …”
    Get full text
    Get full text
    Thesis
  13. 13

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…Firstly, k-luster could incorporate additional clustering algorithms, or even classification algorithms in the future. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14

    Novel Link Establishment Communication Scheme against Selfish Attack Using Node Reward with Trust Level Evaluation Algorithm in MANET by Hemalatha, S., Kshirsagar, P.R., Manoharan, H., Vasantha Gowri, N., Vani, A., Qaiyum, S., Vijayakumar, P., Tirth, V., Haleem, S.L.A., Chakrabarti, P., Teressa, D.M.

    Published 2022
    “…This scheme selects genuine node for routing path production, by using the node reward with dependence level estimating algorithm to compute every node trust level and resource range, to disconnect higher trust level node and lower trust level node; higher trust level node is a genuine node which performs secure communication. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network by Almuslehi, Hussein Saad Mohammed

    Published 2023
    “…Pheromone trails mark efficient routes, reinforcing paths with higher pheromone concentrations. This optimizes data transmission, enhances energy efficiency, and extends network longevity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…The DLBR then uses this metric to select high capacity links for data forwarding, thus providing paths with less congested nodes and high capacity links. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…The DLBR then uses this metric to select high capacity links for data forwarding, thus providing paths with less congested nodes and high capacity links. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

    Published 2010
    “…ImpTR protocol uses an approach to select next hope depending on new algorithm and uses the same tree topology construction for distributing address to all sensor nodes in the network. …”
    Get full text
    Get full text
    Thesis
  20. 20