Search Results - (( basic solution path algorithm ) OR ( java implementation modified algorithm ))

Search alternatives:

Refine Results
  1. 1
    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Shortest Path Trajectory System Based on Dijkstra Algorithm

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation

    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation by Hasan, Talib Hashim, Chowdhury, Md. Sazzad Hossien, Prayoto, .

    Published 2011
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Embedding Malaysian House Red Ant Behavior into an Ant Colony System

    Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  7. 7
    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
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
    Save to List
    Saved in:
  8. 8
    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Ant system with heuristics for capacitated vehicle routing problem

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…As a result, the ASH algorithm is a viable alternative for addressing the CVRP with satisfactory solution quality and run time.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Prevention And Detection Mechanism For Security In Passive Rfid System

    Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

    Published 2013
    “…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…The proposed algorithm is found to provide better solutions with shorter paths when applied to TSP as compared to swap sequence based PSO. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Automatic generation of content security policy to mitigate cross site scripting

    Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

    Published 2016
    “…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Travelling Salesman Problem using Prim Algorithm in High Performance Computing

    Travelling Salesman Problem using Prim Algorithm in High Performance Computing by Wan Harun, Wan Nurhafizah

    Published 2007
    “…This preliminary report emphasizes on the basic terms of the efficient job scheduling algorithm for traveling salesman problem in high performance computing. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  14. 14
    Enhanced Mobility Solution In Mobile Ipv6 Network

    Enhanced Mobility Solution In Mobile Ipv6 Network by David, Adeniji Oluwashola

    Published 2008
    “…The information from the analysis of the result shows that the enhanced solution has drastically reduced average packet delay to minimum with 72.5 %( 0.040s to 0.011s), and end-end delay with 75 %( 0.020s to 0.005s) compared with NEMO solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller

    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

    Published 2010
    “…This algorithm encode a potential solution to a specific problem on a simple chromosome like data structure and apply recombination operators to this structure to preserve critical information. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system

    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

    Published 2011
    “…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    SNR-Based OLSR Routing Protocol for Wireless Mesh Networks

    SNR-Based OLSR Routing Protocol for Wireless Mesh Networks by Elobaid, Mohamed Elshaikh

    Published 2009
    “…Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Challenges of hidden data in the unused area two within executable files

    Challenges of hidden data in the unused area two within executable files by Naji, Ahmed Wathik, Zaidan, A.A., Zaidan, B.B.

    Published 2009
    “…Results: The programs were coded in Java computer language and implemented on Pentium PC. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Mitigating malicious nodes using trust and reputation based model in wireless sensor networks

    Mitigating malicious nodes using trust and reputation based model in wireless sensor networks by Abdullah, Muhammad Daniel Hafiz

    Published 2018
    “…These applications are basically involve in monitoring of sensitive information such as tracking of enemy movement and patient’s health information. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Fuzzy-based multi-agent approach for reliability assessment and improvement of power system protection

    Fuzzy-based multi-agent approach for reliability assessment and improvement of power system protection by Nadheer Abdulridha, Shalash

    Published 2015
    “…Meanwhile, the second MAS model has been designed using two agents as follows: the first agent is a fault current agent that is to determine the fault current at all points before and after grounding; the second agent is the time operating of the agent which is used to determine the relay operating time before and after modifying fault current. The simulation results for the first and second models are done using the data obtained from Malaysia distribution network (DISCO-Net) and 69 bus test system that were implemented using Java Agent Development Framework package software. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: