Search Results - (( program quality search algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1

    Local search heuristics for elective surgery scheduling considering patient urgency by Rashid, N. S. A., Rahmin, N. A. A., Leong, W. J., Mohamed Ali, Nazihah

    Published 2019
    “…To test the efficiency of our proposed heuristics, we compare the solutions of integer linear programming model with the heuristics. The results show that solutions obtained by the local search algorithm are good quality and has significantly reduce the computational time even when considering more surgeries in the waiting list.…”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…The problem solver needs to scan across a large array of available solutions during their search. This problem belongs to a class of combinatorial and NP-Hard problems that requires an efficient search algorithm to maintain the quality of solutions and a reasonable execution time. …”
    Get full text
    Get full text
    Article
  3. 3

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…Standard Integer Programming / Decision Related Integer Programming (SIP/DRIP) is a reduct searching system that finds the reducts in an information system. …”
    Get full text
    Get full text
    Thesis
  4. 4

    An analysis on the applicability of meta-heuristic searching techniques for automated test data generation in automatic programming assessment by Musa, Ja’afar, Romli, Rohaida, Yusoff, Nooraini

    Published 2019
    “…Several recent MHST are included in the comparative evaluation combining both the local and global search algorithms ranging from the year of 2000 until 2018. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Intelligent examination timetabling system using hybrid intelligent water drops algorithm by AlDeeb, Bashar A., Md Norwawi, Norita, Al-Betar, Mohammed A., Jali, Mohd Z.

    Published 2015
    “…This paper proposes Hybrid Intelligent Water Drops (HIWD) algorithm to solve Tamhidi programs uncapacitated examination timetabling problem in Universiti Sains Islamic Malaysia (USIM).Intelligent Water Drops algorithm (IWD) is a population-based algorithm where each drop represents a solution and the sharing between the drops during the search lead to better drops.The results of this study prove that the proposed algorithm can produce a high quality examination timetable in shorter time in comparison with the manual timetable.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8
  9. 9

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…This thesis presents an investigation of using the Intelligent Water Drops (IWD) algorithm to construct and produce good quality solutions for the UETP. …”
    thesis::doctoral thesis
  10. 10
  11. 11

    Some Metaheuristics for Tourist Trip Design Problem by Son, N.T., Nguyet Ha, T.T., Jaafar, J.B., Anh, B.N., Giang, T.T.

    Published 2023
    “…The results show that ACO's swarm search strategy allows for finding slightly better-quality solutions than GA. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    A Compromise Programming to Task Assignment Problem in Software Development Project by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N., Binh, H.D., Aftab, M.U.

    Published 2021
    “…We designed a genetic algorithm scheme to solve the transformed problem. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. by S. Ahmed, Bestoun, Enoiu, Eduard, Afzal, Wasif, Kamal Z., Zamli

    Published 2020
    “…The results show the Q-EMCQ is also capable of outperforming the original EMCQ as well as several recent meta/hyper-heuristic including modified choice function, Tabu high-level hyperheuristic, teaching learning-based optimization, sine cosine algorithm, and symbiotic optimization search in clustering quality within comparable execution time.…”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17

    Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms by Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Leman, Zulkiflle, Delgoshaei, Aidin

    Published 2015
    “…In this article, an effective backward-forward search method (BFSM) is proposed using Greedy algorithm that is employed as a part of a hybrid with a two-stage genetic algorithm (BFSM-GA). …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Synthesizing agent for Wumpus World / Ainul Azlinda Abu Bakar by Abu Bakar, Ainul Azlinda

    Published 2004
    “…Agent synthesis is an automatic programming that will automatically deliver an agent into an environment, and will do the task given successfully in that particular environment. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Genetic Mutation of Cowpea as a Constrained Stochastic Optimization Problem in Sustainability by Emmanuel, Okewu, Kehinde, Okewu, Siti Sarah, Maidin, Wong, Ling Shing

    Published 2023
    “…Using series of experiments in Python programming, we applied genetic algorithm to the genetic mutation of cowpea, a tropical leguminous plant and protein-rich crop. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…Four of the datasets were then chosen for further experiment. The improved search strategy implemented the non-chronological backtracking search that potentially prunes the large portion of search space. …”
    Get full text
    Get full text
    Thesis