Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/60643Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Mushthofa | |
| dc.contributor.author | Kurnianto, Paulus Bangun | |
| dc.date.accessioned | 2013-02-11T06:55:25Z | |
| dc.date.available | 2013-02-11T06:55:25Z | |
| dc.date.issued | 2012 | |
| dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/60643 | |
| dc.description.abstract | Scheduling tasks has been known to be computationally expensive and some of this problem has been shown to be NP-complete. Previous research has been done to build a system that applied Answer Set Programming (ASP) to solve the problem of exam scheduling for the undergraduate Major-Minor System in Bogor Agricultural University. The results showed that the system is capable of generating exam schedule in acceptable time for relatively small-sized datasets, but not for bigger-sized datasets. The purpose of this research is to improve the performance of the exam scheduling system. In this research, we used clingo, a part of Potassco, as the ASP solver. The results of this system showed that there were efficiency improvements in the process time by 33,72% and the space used during the process by 51,93%. This system is also capable of generating exam schedule for bigger-sized data than the previous system. | en |
| dc.publisher | IPB ( Bogor Agricultural University ) | |
| dc.subject | answer set programming | en |
| dc.subject | clingo | en |
| dc.subject | Potassco | en |
| dc.subject | scheduling | en |
| dc.title | Efficiency Improvement of Exam Scheduling System Using Answer Set Programming | en |
| dc.title | Peningkatan Efisiensi Sistem Penjadwalan Ujian Menggunakan Answer Set Programming | |
| Appears in Collections: | UT - Computer Science | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| G12pbk.pdf Restricted Access | fulltext | 1.76 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.