Modified brute force algorithm to solve the closest pair of points problem based on dynamic warping

Dellosa, Rhowel M.; Fajardo, Arnel C.; Medina, Ruji P.

doi:10.11591/ijeecs.v15.i3.pp1629-1636

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Prosedur pemecahan brute force atau algoritma brute force adalah algoritma pencarian string yang paling sederhana. Teks berbeda dalam larik T[1…n] dan polanya berada dalam larik P[1…m] [15] sehingga algoritma brute force untuk pencocokan string terlihat seperti dibawah ini :…”

Section: Algoritma Brute Forceunclassified

Implementasi Algoritma Brute Force Pada Sistem Pertanahan di Balai Desa

Rahayu,

Hanafi,

Maimunah

2023

JoSYC

View full text Add to dashboard Cite

Development epoch in era globalization like current information systems utilizing computer technology which is very sophisticated and modern will facilitate data processing which can save time and cost. Result information obtained will facilitate data processing which can save or agencies that utilize artificial intelligence humans or is often called artificial intelligence (AI). Processing data and information fast and efficiently are important things which are needed by an agency, one is office hall village. Processing or archiving books C or Letter C this village still uses manual methods with recording or writing data at books archives villages and views reworked sequence number parcel book C or Letter C previous: to record numbers on owners of old land and owner new land. The way is certainly not efficient because it will require a lot of books and take a lot of time to record data on ownership of land. Objective of this study i.e. implement algorithm brute force to facilitate the search owners land previous on archive electronic. Method development on a system which is used in research is a brute force algorithm in searching for land data, string matching is a part of the string search process. The resulting land data is very dependent on the technique or algorithm carried out in matching the string. In this study, the algorithm used in string matching is brute force. This algorithm performs matching strings with shifts one by one patterns and adjusts them to text so that between Pattern and Text have patterns which are equal. Results analysis of studies This is in the form of trials trial matching strings-with algorithms brute force with studies case using search or search engine with programming language PHP to matching strings.

show abstract

Section: Algoritma Brute Forceunclassified

Implementasi Algoritma Brute Force Pada Sistem Pertanahan di Balai Desa

Rahayu,

Hanafi,

Maimunah

2023

JoSYC

View full text Add to dashboard Cite

show abstract

“…This motivated the researcher to develop an alternative position estimation algorithm that will improve the efficiency by reducing the number of comparisons of the localization process. The concept of dynamic time warping and heuristic steps of [6], [7], [8] and [9] are considered in this study while the careful investigation used by [12], [3] and [14] was became the model on how the study was conducted.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Position Estimation of Indoor Positioning System Based on Dynamic Time Warping

Dellosa¹

2020

IJATCSE

View full text Add to dashboard Cite

Fingerprinting is an effective indoor localization technique used for indoor positioning systems. However, this localization technique has drawbacks in terms of efficiency of position estimation. In this study, the increase in efficiency of position estimation was considered. To achieve this, a method was developed to reduce the number of comparisons. Result shows that a reduction on number of comparisons was 86.06% as compared with the brute force method of determining the estimated position.

show abstract