Etria Sepwardhani Purba
Institut Teknologi Sepuluh Nopember

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

Found 2 Documents
Search

Analisis Perilaku Verbal Pemain Mobile Legends Berusia 13-17 Tahun secara Daring Nur Aini Rakhmawati; Etria Sepwardhani Purba; Cita Engedi K; Venus Oktanada Gemilang; Renada Aulia Salsabila; Amir Mu’tashim Billah
Cakrawala - Jurnal Humaniora Vol 20, No 2 (2020): September 2020
Publisher : Universitas Bina Sarana Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31294/jc.v20i2.7013

Abstract

The purpose of this paper was to analyse online verbal behaviour related to the activities of online game players in the Mobile Legends game especially for children aged 13-17 years. As is commonly found many social media accounts of Mobile Legends players often upload streaming video games and many aggressive esxpressions are spoken or typed during the game. This research used qualitative methods by using players social media accounts as data soures. From these data source can be obtained about about the verbal behaviours of online game players gathered from their personal social media accounts. Based in the results of data analysis, most players often used aggressive verbal words when they feel dejected about other players or when the game’s atmosphere heated up or also if the players is ini an unfavorable condition during the game. This certainly has a bad impact on children because it can be a bad habit because they often used the words that are aggressive during playing the game.
Aplikasi Kombinasi Heuristik dalam Kerangka Hyper-Heuristic untuk Permasalahan Penjadwalan Ujian Gabriella Icasia; Raras Tyasnurita; Etria Sepwardhani Purba
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 4 No 4 (2020): Agustus 2020
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (480.765 KB) | DOI: 10.29207/resti.v4i4.2066

Abstract

Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem. On a large scale of data, the examination timetabling problem becomes a complex problem and takes time if it solved manually. Therefore, heuristics exist to provide reasonable enough solutions and meet the constraints of the problem. In this study, a real-world dataset of Examination Timetabling (Toronto dataset) is solved using a Hill-Climbing and Tabu Search algorithm. Different from the approach in the literature, Tabu Search is a meta-heuristic method, but we implemented a Tabu Search within the hyper-heuristic framework. The main objective of this study is to provide a better understanding of the application of Hill-Climbing and Tabu Search in hyper-heuristics to solve timetabling problems. The results of the experiments show that Hill-Climbing and Tabu Search succeeded in automating the timetabling process by reducing the penalty 18-65% from the initial solution. Besides, we tested the algorithms within 10,000-100,000 iterations, and the results were compared with a previous study. Most of the solutions generated from this experiment are better compared to the previous study that also used Tabu Search algorithm.