Search Results - (( its application ((graph algorithm) OR (acs algorithm)) ) OR ( _ application sensor algorithm ))*

Refine Results
  1. 1
  2. 2
  3. 3

    Multi-training sensor networks with bipartite conflict graphs by Ishak, Ruzana, Olariu, Stephan, Salleh, Shahruddin

    Published 2006
    “…The corresponding task is referred to as multi-training.The main contribution of this work is to show that in case the conflict graphs of the AFN coverage is bipartite, multi-training can be completed very fast by a simple algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4
  5. 5

    Performance comparison of classification algorithms for EEG-based remote epileptic seizure detection in wireless sensor networks by Abualsaud, Khalid, Mahmuddin, Massudi, Saleh, Mohammad, Mohamed, Amr

    Published 2014
    “…Identification of epileptic seizure remotely by analyzing the electroencephalography (EEG) signal is very important for scalable sensor-based health systems.Classification is the most important technique for wide-ranging applications to categorize the items according to its features with respect to predefined set of classes.In this paper, we conduct a performance evaluation based on the noiseless and noisy EEG-based epileptic seizure data using various classification algorithms including BayesNet, DecisionTable, IBK, J48/C4.5, and VFI.The reconstructed and noisy EEG data are decomposed with discrete cosine transform into several sub-bands.In addition, some of statistical features are extracted from the wavelet coefficients to represent the whole EEG data inputs into the classifiers.Benchmark on widely used dataset is utilized for automatic epileptic seizure detection including both normal and epileptic EEG datasets.The classification accuracy results confirm that the selected classifiers have greater potentiality to identify the noisy epileptic disorders.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6
  7. 7

    DC-based PV-powered home energy system by Sabry, Ahmad H.

    Published 2017
    “…In residential applications, energy engineers are always looking for optimal utilization of solar power to manage the energy use and reduce its impact on our economy and environment. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10
  11. 11

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
    Get full text
    Get full text
    Final Year Project
  12. 12

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…Although the swmcan algorithm solves the noise problem in multi-view data, its initial and final graphs are independent and cannot learn from each other. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…MVC and MIS are notable for its capability of modelling other combinatorial problems and real-world applications. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    “…Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18
  19. 19
  20. 20

    Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim by Hashim, Hazwani

    Published 2014
    “…Thus it leads to the establishment of an improvised Graph Dynamics Algorithm which is used to assist the analysis of graph dynamics of FACS in CFB. …”
    Get full text
    Get full text
    Thesis