Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Naimah Mohd-Hussin"'
Autor:
Naimah Mohd Hussin, Ammar Azlan
Publikováno v:
Journal of Computing Research and Innovation, Vol 2, Iss 1, Pp 29-35 (2018)
Every semester, a new batch of final year students needs to find a topic and a supervisor to complete their final year project requirement. The problem with the current approach is that it is based on first come first serve. So, the pairing between s
Externí odkaz:
https://doaj.org/article/02f1588de40c48a4804249b3a7c762d5
Publikováno v:
Indonesian Journal of Electrical Engineering and Computer Science. 15:1109
The construction of population of initial timetable is an essential stage in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it may impact the quality of the final timetable. This pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5ac37e9b1722a4769703877465a3cee
https://doi.org/10.11591/ijeecs.v15.i2.pp1109-1118
https://doi.org/10.11591/ijeecs.v15.i2.pp1109-1118
Autor:
Naimah Mohd Hussin, Juliana Wahid
Publikováno v:
AIP Conference Proceedings.
The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::063de28f7ec48144d29b7c47c82a739d
https://doi.org/10.1063/1.4960944
https://doi.org/10.1063/1.4960944
Publikováno v:
Procedia Technology. 1:390-394
Understanding human potentials in teams are crucial because having the right people in a team can impact team performance. However, to date, there is no consensus on the right composition of team members because team dynamism and its interrelated fac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be3f303175928ac8bcb3a9cd1e8272e5
Autor:
Naimah Mohd Hussin, Juliana Wahid
Publikováno v:
2013 IEEE Conference on Open Systems (ICOS).
An essential aspect that contributes to the success of meta-heuristic algorithm over a curriculum-based course timetabling problem is determined by the neighborhood structure used. The basic neighborhood structures such as move and swap between lectu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b07fed2934d5c86f1b0fc336d9d792a2
https://doi.org/10.1109/icos.2013.6735070
https://doi.org/10.1109/icos.2013.6735070
Autor:
Juliana Wahid, Naimah Mohd Hussin
Publikováno v:
2013 IEEE 3rd International Conference on System Engineering and Technology.
University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable. An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f620e36c4e7bec576fad0408bf0edd3
https://doi.org/10.1109/icsengt.2013.6650161
https://doi.org/10.1109/icsengt.2013.6650161
Autor:
Naimah Mohd Hussin, Ammar Azlan
Publikováno v:
2013 IEEE Symposium on Computers & Informatics (ISCI).
Curriculum-based course timetabling problem (CB-CTP) is a classical problem that is still being researched on nowadays. There are two phases in solving CB-CTP. The first phase is the construction phase where a population of initial solutions is gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::085e7f88a72c5f931e1c9823afecb9cd
https://doi.org/10.1109/isci.2013.6612369
https://doi.org/10.1109/isci.2013.6612369
Autor:
Naimah Mohd Hussin, Juliana Wahid
Publikováno v:
2012 International Conference on Computer & Information Science (ICCIS).
This research article presents the adaption of the harmony annealing algorithm for solving timetabling problems, with particular focus on the curriculum-based course timetabling that formed part of the competition track 3 of the 2nd International Tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9e179e1ed914440eda0d1f5d340cbd4
https://doi.org/10.1109/iccisci.2012.6297260
https://doi.org/10.1109/iccisci.2012.6297260
Publikováno v:
2012 International Conference on Computer & Information Science (ICCIS).
This paper presents a Linear-Particle Swarm Optimization (PSO) algorithm for discovering motifs in DNA sequences, and the strengths and weaknesses of using the Linear-PSO for discovering motifs of DNA sequences will be discussed. For the experiment,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1dabf2b5b2009c030268d381fd66c890
https://doi.org/10.1109/iccisci.2012.6297280
https://doi.org/10.1109/iccisci.2012.6297280
Autor:
Hazaruddin Harun, Jiwa Noris Hamid, Naimah Mohd Hussin, Sharifah Lailee Syed Abdullah, Roziana Mohamed Hanaphi
Publikováno v:
2012 IEEE Symposium on Humanities, Science and Engineering Research.
This paper presents the use of the ‘Linear-PSO with Binary Search’ (LPBS) algorithm for discovering motifs, especially species-specific motifs. In this study, two samples from different fragments of ‘mitochondrial cytochrome C oxidase subunit I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64d02604fbb9c6836c732fdae65434f2
https://doi.org/10.1109/shuser.2012.6268794
https://doi.org/10.1109/shuser.2012.6268794