Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Komputer dan Informasi Jurnal Matematika UNAND
Faizah .
Unknown Affiliation
Computer Science & IT Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
IMPLEMENTATION OF GENETIC ALGORITHM FOR STUDENT PLACEMENT PROCESS OF COMMUNITY DEVELOPMENT PROGRAM IN UNIVERSITAS GADJAH MADA Nanang Arfandi; Faizah .
Jurnal Ilmu Komputer dan Informasi Vol 6, No 2 (2013): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (688.345 KB) | DOI: 10.21609/jiki.v6i2.226

Abstract

Community Development Program (CDP) is a required subject in Universitas Gadjah Mada for undergraduate students to earn a bachelor’s degree. One of the big problem in CDP implementation is student placement process into available thematic units. Each unit as much as possible filled by students which have balanced composition based on specified criteria. Balances in gender ratio and clusters composition are needed to have an objective assigned team students in a unit. In this paper, a genetic algorithm is proposed to solve this placement problem. The results of this paper is a simulation in CDP student placement process which using genetic algorithm to produce recommendation units which have good composition.
KARAKTERISASI GRAF POHON DENGAN BILANGAN KROMATIK LOKASI 3 Faizah .; Narwen .
Jurnal Matematika UNAND Vol 5, No 2 (2016)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.5.2.71-77.2016

Abstract

Abstrak. Misalkan c adalah pewarnaan dengan k-warna terhadap suatu graf terhubungG. Misalkan = fS1; S2; ; Sg adalah partisi himpunan V (G) terhadap pewarnaanc, dimana Sikadalah kelas partisi yang memuat semua titik dengan warna i. Kode warnatitik v, dinotasikan c(v), adalah vektor dengan panjang k:c(v) = (d(v; S1); d(v; S2); ; d(v; S));dimana d(v; Si) = minfd(v; x)jx 2 Sikg, untuk 1 i k. Jika semua titik pada Gmemiliki kode warna yang berbeda, maka c disebut pewarnaan lokasi pada G. Bilangankromatik lokasi pada G, dinotasikan (G), adalah bilangan k terkecil sedemikian sehinggaG memiliki pewarnaan lokasi dengan k-warna. Pada tulisan ini dibahas kembalimakalah [2] tentang karakterisasi graf pohon dengan bilangan kromatik lokasi 3.
Co-Authors Nanang Arfandi Narwen Narwen