Search Results - (( using _ ((problem algorithm) OR (bleu algorithm)) ) OR ( java application modified algorithm ))

Refine Results
  1. 1

    Evaluation of structured questions using modified BLEU algorithm by Siraj, Fadzilah, Ali, Mohamed Salem

    Published 2016
    “…This paper describes and exemplifies an application of a Structured Exam Questions Test Bank and Evaluation Using Modified Bilingual Evaluation Understudy (BLEU) Algorithm, a software system developed in pursuit of robust computerized marking of free-text answers to open-ended questions.It employs the Information System Development Research Methodology with modified BLEU Algorithm and Expert System for similar words.The system was developed to facilitate in managing and administrating structured questions for client/server architecture based on intranet. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Hybrid BLEU Algorithm For Structured Exam Management System by Zulhana, Zulkifle

    Published 2008
    “…Apart from that, other workloads do contribute to this scenario. Due to this problem, "Hybrid BLEU algorithm for Structured Exam Management System " is develop to aid the lecturers during assessment in the construction of quiz and test. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

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

    Published 2012
    “…The thesis outlines the two different implementation techniques of the existing FLEX algorithm using java based parsers and using a query language for XML. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Hybrid Machine Translation Using Malay-English Language Parallel Text Extraction From Comparable Text by Yeong, Yin Lai

    Published 2024
    “…We improve the bleu score from 13.40% to 15.41% using 315,194 parallel texts. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Auxiliary-based extension of multi-tasking sequence-to-sequence model for chatbot answers by Palasundram, Kulothunkan

    Published 2021
    “…“SEQ2SEQ++” is a Seq2Seq MTL learning method which comprises of four (4) components (“Multi-Functional Encoder” (MFE), “Answer Decoder”, “Answer Encoder”, “Ternary-Classifier” (TC)) and is trained using “Dynamic Weights” algorithm and “Comprehensive Attention Mechanism” (CAM). …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2013
    “…A GUI is created in a form of JAVA application to display data detected from tag. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

    Published 2016
    “…The algorithm is implemented as a plugin. It does not interfere with the web application original code. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

    Published 2008
    “…This project will focusing on the method used to solve an optimization problem, the limitation of the method used and the results of solving flow shop sequencing problem using genetic algorithm method. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  9. 9

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Comparison between ant colony and genetic algorithm using traveling salesman problem by Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah

    Published 2013
    “…In ant colony algorithm each individual ant constructs a part of the solution using an artificial pheromone which reflects its experience accumulated while solving the problem and heuristic information dependent on the problem. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2018
    “…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

    Published 2023
    “…The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

    Published 2022
    “…Meta-heuristic algorithms are mostly used to solve this problem. For example, Genetic Algorithm with Particle Swarm Optimization, Genetic Algorithm with Artificial Bee Colony Algorithms (ABC) and Genetic Algorithm with Ant Colony Optimization Algorithms. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
  17. 17

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…The comparison of the result of the developed integrated algorithm using two benchmark FMS scheduling algorithms datasets is conducted. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

    Published 2021
    “…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
    Get full text
    Get full text
    Article
  19. 19

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The algorithm is a hybrid algorithm that operates using dual level search strategy that takes merits of a particle swarm optimisation algorithm and a modified adaptive bats sonar algorithm. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

    Published 2024
    “…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Thesis