Wamiliana, Wamiliana and Kurniasari, Dian (2013) Implementasi Metode Dynamic Programming pada Aplikasi Penentuan Jarak Minimum. Jurnal Komputasi, 1 (1). pp. 1014. ISSN 25410350

Text
Implementasi Metode Dynamic Programming.pdf Download (955kB)  Preview 
Abstract
Mathematics and Computer Science are closely related. Many problems that appear in Computer Sciences problems can be solved by using mathematical techniques or concepts; for example, finding the nearest distance, minimum fares, or minimum time. The determination of the minimum value can be found by using of mathematical programming, namely dynamic programming. Nevertheless, there are several another consideration factors such as security roads impassable, the vehicle used, comfortability road infrastructure, and others. Dynamic programming is one of the methods in mathematics which is useful to create a sequence of interrelated decisions, and provides a systematic procedure to determine the optimal combination of a decision. This paper will discuss about dynamic programming that applied in the determination of the minimum distance. Determination of the minimum distance will use an application to make it easier for calculation.
Item Type:  Article 

Subjects:  Q Science > QA Mathematics > QA75 Electronic computers. Computer science 
Divisions:  Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer 
Depositing User:  DIAN KURNIASARI 
Date Deposited:  04 Jun 2018 06:32 
Last Modified:  04 Jun 2018 06:32 
URI:  http://repository.lppm.unila.ac.id/id/eprint/7003 
Actions (login required)
View Item 