Search Results - (( java implication force algorithm ) OR ( a constructive approach algorithm ))

Refine Results
  1. 1

    An evolutionary based features construction methods for data summarization approach by Rayner Alfred, Suraya Alias, Chin, Kim On

    Published 2015
    “…Here, feature construction methods are applied in order to improve the descriptive accuracy of the DARA algorithm.This research proposes novel feature construction methods, called Variable Length Feature Construction without Substitution (VLFCWOS) and Variable Length Feature Construction with Substitution(VLFCWS), in order to construct a set of relevant features in learning relational data. …”
    Get full text
    Get full text
    Research Report
  2. 2
  3. 3

    Ant system-based feature set partitioning algorithm for classifier ensemble construction by Abdullah, , Ku-Mahamud, Ku Ruhana

    Published 2016
    “…All of these approaches attempt to generate diversity in the ensemble.However, classifier ensemble construction still remains a problem because there is no standard guideline in constructing a set of accurate and diverse classifiers. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Hyper-Heuristic Evolutionary Approach for Constructing Decision Tree Classifiers by Kumar, Sunil, Ratnoo, Saroj, Vashishtha, Jyoti

    Published 2021
    “…Finding optimal values for the hyper parameters of a decision tree construction algorithm is a challenging issue. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…This paper investigates the construction phase approach in which the sequential order of the courses/lectures applied several combination of graph heuristics to generate a population of initial solutions in curriculum-based course timetabling (CBCTT).The construction of population of initial solution is a prerequisite in a population-based metaheuristic implementation. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

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

    Published 2024
    “…A case study conducted with USIM Tamhidi programs to evaluate the Hybrid-IWD algorithm has produced a successful Tamhidi exam timetable in comparison with manual approach.…”
    thesis::doctoral thesis
  8. 8

    Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

    Published 2015
    “…Hence, this new algorithm is a viable alternative for constructing generalized Ball surfaces. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Development of a scheduling tool for constructing a Malaysian school timetable using genetic algorithms / Salihin Farag Shoeeb by Salihin Farag , Shoeeb

    Published 2003
    “…A recent approach to derive a near-optimal solution is to use evolutionary or genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…However, these traditional approaches bias toward the initial timetable where the improvement algorithms (sometimes) are affected and unable to produce a quality timetable. …”
    Get full text
    Get full text
    Thesis
  11. 11

    A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

    Published 2013
    “…The second proposed algorithm uses SA to optimize the terms selection while constructing a rule. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition by Yahya, Anwar Ali, Mahmod, Ramlan, Ramli, Abd Rahman

    Published 2010
    “…The model is, essentially, a dynamic Bayesian network induced from manually annotated dialogue corpus via dynamic Bayesian machine learning algorithms. …”
    Get full text
    Get full text
    Article
  14. 14

    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2021
    “…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Student Project
  15. 15

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    “…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Research Reports
  16. 16
  17. 17
  18. 18

    Optimized feature construction methods for data summarizations of relational data by Sze, Florence Sia Fui

    Published 2014
    “…Dynamic Aggregation of Relational Attributes (DARA) algorithm is one of the approaches to summarize data stored in a target table that has a one-to-many relationship with data stored in a non-target table. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Rahim At Samsuddin, H. A., Ab. Rahman, A. A. H., Andaljayalakshmi, G., Ahmad, R. B.

    Published 2008
    “…A binary tree method for non-slicing tree construction process is utilized for the placement and area optimization of macro-cell layout in very large scaled integrated (VLSI) design. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item