Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Jurnal Informatika Jurnal Infra ComTech: Computer, Mathematics and Engineering Applications
Rolly Intan
Program Studi Teknik Informatika
Computer Science & IT Engineering Mathematics

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

Found 23 Documents
Search

 1   2   3 
PENGGUNAAN HIBRIDISASI GENETICS ALGORITHMS DAN FUZZY SETS UNTUK MEMPRODUKSI PAKET SOAL Intan, Rolly
Jurnal Informatika Vol 6, No 1 (2005): MAY 2005
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (247.355 KB) | DOI: 10.9744/informatika.6.1.pp. 24-30

Abstract

At least, two important factors, discrimination and difficulty, should be considered in determing whether a problem should be in a packet of problems produced for students entrance examination at a university. The higher the discrimination degree of a problem, the better the problem is used to make a selection of participants based on their intellectual capability. How to provide a packet of entrance examination problems satisfying a determined pattern of discrimination and difficulty is a major problem in this paper for which an algorithm, it can be proved that the beneficiary of applying fuzzy sets and fuzzy relation in determing the first chromosome in the process of GA is that the process can reach tolerable solutions faster. Maximum number of generation is still needed as a threshold to overcome the problem of run time system overflow. Generally, the problems in the form of passages tend to have lower fitnest cost. Abstract in Bahasa Indonesia : Proses penyusunan paket soal (misalnya soal untuk test seleksi masuk universitas) yang diambil dari suatu bank soal, minimal harus memperhatikan dua aspek penting yaitu: tingkat kesulitan dan tingkat diskriminan soal. Semakin tinggi tingkat diskriminan suatu soal, semakin baik soal tersebut dipakai untuk menyeleksi kemampuan peserta test. Permasalahan yang dihadapi adalah bagaimana agar pembuat soal dapat memilih dan menentukan kombinasi soal-soal yang tepat (optimum) sehingga dapat memenuhi tingkat kesulitan dan diskriminan yang dikehendaki. Untuk menyelesaikan masalah ini, diperkenalkan suatu algoritma yang disusun dengan menggunakan hibridisasi metode Genetics Algorithm dan fuzzy sets. Dari hasil pengujian, didapatkan bahwa penggunaan fuzzy sets dan fuzzy relations dalam pemilihan kromoson awal akan lebih mempercepat pencapaian tolerable solutions. Tetap dibutuhkan treshould maksimum jumlah generasi yang dilakukan untuk mencegah run time sistem overflow. Soal bacaan cenderung memiliki nilai Fitnest Cost yang lebih rendah daripada nilai Fitnest Cost untuk paket soal bukan soal bacaan. Kata kunci: genetics algorithm, fuzzy sets, hibridization method.
APPLICATION OF CONDITIONAL PROBABILITY IN PREDICTING INTERVAL PROBABILITY OF DATA QUERYING Intan, Rolly
Jurnal Informatika Vol 5, No 2 (2004): NOVEMBER 2004
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (99.961 KB) | DOI: 10.9744/informatika.5.2.pp. 135-146

Abstract

This paper discusses fuzzification of crisp domain into fuzzy classes providing fuzzy domain. Relationship between two fuzzy domains, Xi and Xj, can be represented by using a matrix, wij. If Xi has n elements of fuzzy data and Xj has m elements of fuzzy data then wij is n x m matrix. Our primary goal in this paper is to generate some formulas for predicting interval probability in the relation to data querying, i.e., given John is 30 years old and he has MS degree, how about his probability to get high salary.
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD Intan, Rolly
Jurnal Informatika Vol 6, No 2 (2005): NOVEMBER 2005
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (186.583 KB) | DOI: 10.9744/informatika.6.2.pp. 100-104

Abstract

A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the customers. The problem may be considered as the quickest path problem. We may consider the quickest path problem as an extension of the shortest path problem. The quickest path problem optimizes length of time in visiting some places. The quickest path is not always the shortest path. In the relation to the problem, this paper proposes an algorithm for solving the quickest path problem. The algorithm is constructed by modifying a concept of transitive closure method.
Co-Authors A.A. Ketut Agung Cahyawan W Andreas Handojo Andy Gunawan Chandra, Vincent Andrian Christopher Imantaka Halim Dimas Adiputra Gunawan Dwi Kristanto Edward Primanata Yoewono Edwin Suseno, Edwin Erwin -- Evelyn Njoto, Evelyn Febria Roosita Dwi, Febria Roosita Gregorius Satia Budhi Hartono Hartono Ivan Wijaya Kristo Radion Purba Leo Willyanto Santoso Liliana - Liliana Liliana Michael Constantine Wijaya Nydia Valentina Wahono Oviliani Yenty Yuliana Siget Wibisono Valentina, Nydia Wibawa, Timothy Handi Wiwie Yoanna Yulia -