Search Results - (( developing efficient computational algorithm ) OR ( java application mining algorithm ))

Refine Results
  1. 1

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2
  3. 3
  4. 4

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

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

    Published 2022
    “…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  6. 6
  7. 7

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

    Published 2005
    “…The first approach is to develop an efficient sequential algorithm for the window method. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Computationally efficient sequential learning algorithms for direct link resource-allocating networks by Asirvadam , Vijanth Sagayan, McLoone, Sean, Irwin, George W

    Published 2005
    “…Computationally efficient sequential learning algorithms are developed for direct-link resource-allocating networks (DRANs). …”
    Get full text
    Get full text
    Article
  10. 10

    Pengesan lalu lintas dengan kaedah pemerosesan imej by Riza Atiq O.K.Rahmat, Kasmiran Jumari, Azmi Hassan, Hassan Basri

    Published 2001
    “…This study was conducted to develop efficient traffic detector using image-processing with a personal compute I: Traffic images were captured using ordinary analogue video camera and digitised using a video blastel: Four algorithms were developed i. e. algorithm for traffic counting, algorithm for vehicle classification. algorithm to determine the speed of the counted vehicles and algorithm for incident detection. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

    Published 2012
    “…The issue is not only to develop new algorithms, but also to evaluate them on an experimental computational grid, using synthetic and real workload traces, along with the other existing job scheduling algorithms. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Performance-aware cost-effective brokering and load balancing algorithms for data center in large scale cloud computing by Naha, Ranesh Kumar

    Published 2015
    “…In order to make our proposed method cost efficient, we developed Load Aware Over Cost algorithm which is 8% cost effective comparing with Load Aware algorithm. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Computation of cryptosystem based on Lucas functions using addition chain by Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir

    Published 2010
    “…Smaller computation time means the algorithm is efficient than the other. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…Vehicle routing problem is difficult to solve using exact methods especially for large size instances due to computational expensive. Therefore, metaheuristic method based genetic algorithm has been developed to obtain feasible and optimal solution with less computation time. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. These algorithms are formulated for computing Tate and ate pairing. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Performance enhancement of AIMD algorithm for congestion avoidance and control by Jasem, Hayder Natiq

    Published 2011
    “…The results have shown improvement in all aspects particularly the major ones, efficiency and fairness over the previous algorithms.…”
    Get full text
    Get full text
    Thesis
  18. 18

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
  19. 19

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…Adopting the medoid instead of the mean can enhance the efficiency. However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis