String matching using Q-Gram Algorithm Processing and Priority Service Based on the shortest service time in Queue System.

Novezius, Christopher (2010) String matching using Q-Gram Algorithm Processing and Priority Service Based on the shortest service time in Queue System. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

[img]
Preview
Text (COVER)
06.02.0071 Christopher Novezius COVER.pdf

Download (46kB) | Preview
[img] Text (BAB I)
06.02.0071 Christopher Novezius BAB I.pdf
Restricted to Registered users only

Download (32kB)
[img] Text (BAB II available document only in library of Soegijapranata Catholic University)
06.02.0071 Christopher Novezius BAB II.pdf
Restricted to Repository staff only

Download (37kB)
[img] Text (BAB III available document only in library of Soegijapranata Catholic University)
06.02.0071 Christopher Novezius BAB III.pdf
Restricted to Repository staff only

Download (33kB)
[img] Text (BAB IV available document only in library of Soegijapranata Catholic University)
06.02.0071 Christopher Novezius BAB IV.pdf
Restricted to Repository staff only

Download (107kB)
[img] Text (BAB V available document only in library of Soegijapranata Catholic University)
06.02.0071 Christopher Novezius BAB V.pdf
Restricted to Repository staff only

Download (391kB)
[img] Text (BAB VI)
06.02.0071 Christopher Novezius BAB VI.pdf
Restricted to Registered users only

Download (30kB)
[img]
Preview
Text (DAFTAR PUSTAKA)
06.02.0071 Christopher Novezius DAFTAR PUSTAKA.pdf

Download (32kB) | Preview

Abstract

Queuing system has been widely used in all places the public service, sometimes systemaclly queue was ineffective and time consuming, for it in this project I tried to simulate a bank queue using java language eith the goal of providing effective queue and facilitate the system itself. N-Gram algorithm is used to facilite the computer detects the type of service customers desire by typing on the keyboard, besides Priority Service Algorithm is also used to provide queue effectiveness by directing customers to the counter with the shortest total waiting time.

Item Type: Thesis (Other)
Subjects: 000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions: Faculty of Computer Science
Depositing User: Mr Ign. Setya Dwiana
Date Deposited: 16 Mar 2016 08:46
Last Modified: 16 Mar 2016 08:46
URI: http://repository.unika.ac.id/id/eprint/8000

Actions (login required)

View Item View Item