Pemodelan Matriks dan Penerapan Algoritma Sum of Power Matrix pada Studi Kasus SPOJ TAP2015E – Perfect Packing

Andrianto, Ryan Garnet (2023) Pemodelan Matriks dan Penerapan Algoritma Sum of Power Matrix pada Studi Kasus SPOJ TAP2015E – Perfect Packing. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 05111940000063-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 April 2025. Download (3MB) | Request a copy

Abstract

Perfect Packing adalah sebuah permasalahan sebuah perusahaan yang hendak memproduksi sejumlah bungkus cookie. Perusahaan ini mempunyai banyak cookie yang siap untuk dibungkus. Perusahaan mempunyai sejumlah counting machine yang dapat menghitung dan mengambil sejumlah cookie dengan probabilitas tertentu. Counting machine tersebut mempunyai state yang dapat berubah-ubah di setiap iterasi pembungkusan cookie dan state-nya bergantung pada state di iterasi sebelumnya. Oleh karena itu, Finite State Machine digunakan untuk merepresentasikan hubungan antar state-nya. Topik tugas akhir ini adalah menerapkan pemodelan matriks dan implementasi algoritma sum of power matrix untuk mencari berapa nilai ekspektasi jumlah cookie per bungkus yang dapat diproduksi oleh perusahaan pembuat cookie. Model matriks dan algoritma sum of power matrix digunakan untuk menghitung formula nilai ekspektasi yang berbentuk fungsi rekursi. Tugas akhir ini berhasil menyelesaikan permasalahan di atas dengan kinerja waktu penyelesaian minimal 0,17s dan maksimal 0,28s dengan penggunaan memori minimal 5,2MB dan maksimal 6,1MB.
=================================================================================================================================
Perfect Packing is a problem for a company that produces some packages containing cookies. This company has many cookies that are ready to be packaged. The company has some counting machines that can count and take some cookies with a certain probability. The counting machine has a state that changes every iteration of the packaging process and it depends on the state of the previous iteration. Therefore, a Finite State Machine is used to represent the relationship between its states. The topic of this thesis is the matrix modeling and implementation ofsum of power matrix algorithm to find the expected value of cookies in each package produced by the company after a certain number of iterations. The matrix model and sum of power matrix algorithm are used to calculate the expected value formula in the form of a recursive function. This thesis successfully solves the case study problem with a performance of a minimum of 0.17s and a maximum of 0.28s of execution time. It also solves it with a minimum of 5.2MB and a maximum of 6.1MB of memory usage.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Expected Value, Finite State Machine, Matrix Model, Performance, Recursive, Finite State Machine, Kinerja, Model Matriks, Nilai Ekspektasi, Rekursi.
Subjects:	Q Science > Q Science (General) > Q180.55.M38 Mathematical models Q Science > Q Science (General) > Q325 GMDH algorithms. Q Science > QA Mathematics > QA159 Algebra Q Science > QA Mathematics > QA166 Graph theory Q Science > QA Mathematics > QA184 Algebra, Linear Q Science > QA Mathematics > QA401 Mathematical models. Q Science > QA Mathematics > QA76 Computer software Q Science > QA Mathematics > QA76.6 Computer programming. Q Science > QA Mathematics > QA76.F56 Data structures (Computer science) Q Science > QA Mathematics > QA9.58 Algorithms T Technology > T Technology (General) > T57.62 Simulation T Technology > T Technology (General) > T57.83 Dynamic programming
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User:	Ryan Garnet Andrianto
Date Deposited:	06 Feb 2023 03:14
Last Modified:	06 Feb 2023 03:14
URI:	http://repository.its.ac.id/id/eprint/96205

Actions (login required)

View Item