Search Results - parallel solution ((mining algorithm) OR (window algorithm))

  • Showing 1 - 9 results of 9
Refine Results
  1. 1

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm by Khoo, Thau Soon

    Published 2022
    “…Our algorithm uses non-fitness evolutionary distributed parallelized adaptive large neighbourhood search (NEDPALNS). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Efficient hardware design for palm-dorsa vein image enhancement by Jusoh@Yusoff, Suhaimi Bahisham

    Published 2018
    “…For hardware design of thinning, parallel pipelined with Concurrent Condition Check Unit hardware architecture has been developed to enable the parallelism of the thinning algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6
  7. 7

    Optimizing OLAP heterogeneous computing based on Rabin-Karp algorithm by Alzeini, Haytham I M, Hameed, Shihab A., Habaebi, Mohamed Hadi

    Published 2013
    “…In this paper, through experimental results and based on Rabin-Karp Algorithm; we propose an optimized heterogeneous solution that takes into account the benefits and the boundaries in order to achieve a better OLAP performance in terms of response time with three times gain. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  8. 8

    Hybrid metaheuristics for QOS-aware service composition / Hadi Naghavipour by Hadi , Naghavipour

    Published 2022
    “…An absolute majority of base algorithms for this problem were nature-inspired and population-based metaheuristics extended to complementary methods in hybrid solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

    Published 2018
    “…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
    Get full text
    Get full text
    Get full text
    Article