Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Journal of Computer System and Informatics (JoSYC)

Implementasi Metode Complex Proportional Asessment (COPRAS) Pada Sistem Pendukung Keputusan Pemilihan Bluetooth Audio Transmitter Dedy Alamsyah; Rini Nuraini; Muhammad Bagir
Journal of Computer System and Informatics (JoSYC) Vol 3 No 3 (2022): May 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josyc.v3i3.1695

Abstract

Bluetooth audio transmitter is a device capable of converting wired audio signals into wireless. With a Bluetooth audio transmitter, a TV or PC that doesn't have bluetooth facilities can connect to headphones or speakers without using a cable. However, currently bluetooth audio transmitters have been circulating in the market with various brands and brands that offer different capabilities and specifications. So, it takes foresight in choosing the right bluetooth audio transmitter and as needed. Inaccuracy in choosing a bluetooth audio transmitter results in the device's performance not being maximized and incompatibility with the wishes of the user. This study aims to develop a decision support system for selecting a bluetooth audio transmitter using the Complex Proportional Assessment (COPRAS) approach. The COPRAS method is able to solve election problems through the calculation of the utility level which shows the extent to which an alternative is better or worse than other alternatives through a comparison process. The system built has features such as managing criteria data, determining weights, managing alternatives, assigning a value to each alternative, seeing the results of the COPRAS method calculations and seeing the ranking of the results of the system recommendations. Based on testing through the black-box testing technique, it shows that the system built has been running as it should
Implementasi Algoritma A* (A-Star) dan Greedy Dalam Penentuan Routing Pada Wide Area Network (WAN) Alfry Aristo Jansen Sinlae; Rini Nuraini; Dedy Alamsyah; Sampurna Dadi Riskiono
Journal of Computer System and Informatics (JoSYC) Vol 4 No 3 (2023): May 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josyc.v4i3.3374

Abstract

The continuous development of the internet has led to changes in routing complexity. In the context of a wide area network (WAN), network flow optimization becomes a major issue in the selection of the fastest route, which involves routing protocols. Algorithms in routing protocols are designed to determine the shortest path. Therefore, studies are needed regarding how to build a routing algorithm that can be used to get the shortest path in each process. This study aims to reduce network workload and compare the computation involved in determining the shortest path using the Greedy algorithm and the A* algorithm. The simulation results show that the A* algorithm is superior to greedy. The measurement results show that the final cost of the Greedy algorithm is 44 and the A* algorithm is 38. Taking into account the heuristic value for each node, the A* algorithm is superior to the Greedy algorithm in determining the shortest path.