Search Results - (( developing efficient computational algorithm ) OR ( java implementation among algorithm ))

Search alternatives:

Refine Results
  1. 1
    Network game (Literati) / Chung Mei Kuen

    Network game (Literati) / Chung Mei Kuen by Chung, Mei Kuen

    Published 2003
    “…The main aspect of this thesis is to produce a networked gaming system, which process players. requested to play the game and enabling users to play the graphical game with people through the network. The algorithm design and implementation method must not only be workable, but also highly efficient in terms of execution speed and response time. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Network monopoly / Tan Kean Yeap

    Network monopoly / Tan Kean Yeap by Tan , Kean Yeap

    Published 2002
    “…The main aspect of this thesis is to produce a network monopoly system, which process multiple game sessions concurrently, enabling users to play the graphical game with people within the network. The algorithm design and implementation method mustnot only be workable, but also highly efficient in terms of execution speed and respond time. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    A Toolkit for Simulation of Desktop Grid Environment

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

    Published 2014
    “…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  6. 6
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…According to the simulation results, the proposed algorithm produces the best solution among all algorithms in the proposed cases. � 2021 Little Lion Scientific…”
    Review
    Save to List
    Saved in:
  7. 7
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    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
    Save to List
    Saved in:
  8. 8
    A filtering algorithm for efficient retrieving of DNA sequence

    A filtering algorithm for efficient retrieving of DNA sequence by Abdul Rahman, Mohd Nordin, Mohd. Saman, Md. Yazid, Ahmad, Aziz, Md. Tap, Abu Osman

    Published 2009
    “…An automaton-based algorithm is used to develop the filtering process proposed. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Computationally efficient sequential learning algorithms for direct link resource-allocating networks

    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
    Save to List
    Saved in:
  10. 10
    Pengesan lalu lintas dengan kaedah pemerosesan imej

    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
    Save to List
    Saved in:
  11. 11
    Energy efficiency of the bitcoin mining hardware and related blockchain technology

    Energy efficiency of the bitcoin mining hardware and related blockchain technology by Noor Faiqah Izzati, Afandi

    Published 2018
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  12. 12
    DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS

    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
    Save to List
    Saved in:
  13. 13
    Performance-aware cost-effective brokering and load balancing algorithms for data center in large scale cloud computing

    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
    Save to List
    Saved in:
  14. 14
    Computation of cryptosystem based on Lucas functions using addition chain

    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
    Save to List
    Saved in:
  15. 15
    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints

    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
    Save to List
    Saved in:
  16. 16
    Multi-base number representation in application to scalar multiplication and pairing computation

    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
    Save to List
    Saved in:
  17. 17
    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…The simulation is implemented with iFogSim and java programming language. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Performance enhancement of AIMD algorithm for congestion avoidance and control

    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
    Save to List
    Saved in:
  19. 19
    Path planning for unmanned aerial vehicles using visibility line-based methods

    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
    Save to List
    Saved in:
  20. 20
    SEALiP: A simple and efficient algorithm for listing permutation via starter set method

    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
    Save to List
    Saved in:

Search Tools: