cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Yuni Wibawanti
Contact Email
stringinformatika@gmail.com
Phone
+6281617239740
Journal Mail Official
stringinformatika@gmail.com
Editorial Address
Prodi Teknik Informatika FTIK Universitas Indraprasta PGRI Jl. Raya Tengah Kelurahan Gedong , Pasar Rebo, Jakarta Timur
Location
Kota adm. jakarta selatan,
Dki jakarta
INDONESIA
STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Published by Universitas Indraprasta PGRI
ISSN : 25279661     EISSN : 25492837     DOI : http://dx.doi.org/10.30998/string.v4i3.6197
Core Subject : Science, Education,
Computer Science & IT Mathematics
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) focuses on the publication of the results of scientific research related to the science and technology. STRING publishes scholarly articles in Science and Technology Focus and Scope Covering: 1. Computing and Informatics 2. Industrial Engineering 3. Electrical Engineering 3. Mechanical Engineering 4. Applied Mathematical 5. Physics (Classical and modern) 6. Mathematics and Science
Arjuna Subject : Ilmu Komputer (semua kategori) - Teori Komputasi dan Matematika
Articles 12 Documents
 1   2 
Search results for , issue "Vol 2, No 1 (2017)" : 12 Documents clear
Implementasi Algoritma Jaro-Winkler dan Levenstein Distance dalam Pencarian Data pada Database Yulianingsih Yulianingsih
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 2, No 1 (2017)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (123.148 KB) | DOI: 10.30998/string.v2i1.1720

Abstract

Data is a source of  information that must be valued of contains true meaning which can be used or processed to benefit everyone need. Data can be found or searched in accordance with the needs thus required a good understanding of some search methods to get the right results. In this writing submitted the results of comparative testing using Levenshtein Distance and Jero-Winkler algorithm against a number of human name data which has a high degree of similarity. The purpose of  this study is to determine one of two methods that have highest level of validation in search data that has a high similarity.Testing is done repeatedly and then carried out observations at each stage. Finding can be used as a basic for determining the appropriate method of use in data search.
Implementasi Fuzzy Simple Additive Weighting (SAW) sebagai Pendukung Keputusan pada Beasiswa Penelitian Rahman Abdillah
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 2, No 1 (2017)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (180.603 KB) | DOI: 10.30998/string.v2i1.1733

Abstract

The aim of this research is designing decision support systems (DSS) which helps the decision maker to acquire the decision applied to the candidates which register to the research scholarship program (Riset Inovatif Produktif/RISPRO) from Lembaga Pengelola Dana Pendidikan (LPDP), held by the Ministry of Finance RI. This research use Fuzzy Simple Additive Weighted (FSAW) as a methodology by classified attributes from each criteria rate, then calculate weights of each criteria and rank them as a final result. Decision maker will get recommendation of potential awardees base on rank and score from each candidates. The presented of decision support systems that has been designed hope can help the decision maker to do the process of determining scholarships recipient faster and accurately.

Page 2 of 2 | Total Record : 12

 1   2 

Filter by Year

2017 2017


Reset
Filter By Issues
All Issue Vol 10, No 1 (2025) Vol 9, No 3 (2025) Vol 9, No 2 (2024) Vol 9, No 1 (2024) Vol 8, No 3 (2024) Vol 8, No 2 (2023) Vol 8, No 1 (2023) Vol 7, No 3 (2023) Vol 7, No 2 (2022) Vol 7, No 1 (2022) Vol 6, No 3 (2022) Vol 6, No 2 (2021) Vol 6, No 1 (2021) Vol 5, No 3 (2021) Vol 5, No 2 (2020) Vol 5, No 1 (2020) Vol 4, No 3 (2020) Vol 4, No 2 (2019) Vol 4, No 1 (2019) Vol 3, No 3 (2019) Vol 3, No 2 (2018) Vol 3, No 1 (2018) Vol 2, No 3 (2018) Vol 2, No 2 (2017) Vol 2, No 1 (2017) Vol 1, No 3 (2017) Vol 1, No 2 (2016) Vol 1, No 1 (2016) More Issue