Search Results - (( java implementation means algorithm ) OR ( using computing window algorithm ))
Search alternatives:
- implementation means »
- java implementation »
- window algorithm »
- means algorithm »
- using computing »
-
1
A web-based implementation of k-means algorithms
Published 2022“…The K-means algorithm has been around for over a century. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
2
Date store management in sliding window based on-line identification algorithms
Published 2001Get full text
Get full text
Conference or Workshop Item -
3
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
Published 2005“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text
Thesis -
4
-
5
An enhancement of sliding window algorithm for rainfall forecasting
Published 2017Get full text
Get full text
Get full text
Conference or Workshop Item -
6
Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model
Published 2024“…This method reduces computational costs by efficiently handling the insertion and exit policy for the appropriate tuple candidates within a specified window frame. …”
Get full text
Get full text
Get full text
Thesis -
7
-
8
Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction
Published 2024“…The results also show low memory usage and computing power in comparison with the baseline algorithms. � 2023 THE AUTHORS…”
Article -
9
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
Published 2013“…This paper improves heuristic algorithms presented in Benjamin and Beasley (Comput Oper Res 37(12):2270–2280, 2010) for solving the waste collection vehicle routing problem with time windows, particularly the real life waste collection benchmark problems from Kim et al.…”
Get full text
Get full text
Article -
10
Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application
Published 2020“…This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. …”
Get full text
Get full text
Journal -
11
-
12
Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly
Published 2019“…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
Get full text
Get full text
Thesis -
13
Window based personalized time management system
Published 2012Get full text
Get full text
Undergraduates Project Papers -
14
-
15
Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser
Published 2022“…The main objective of the study is to minimise the number of vehicles to be assigned for the routing problem subjected to the given time windows. The problem was optimised using a new algorithm known as Harris Hawks Optimiser (HHO). …”
Get full text
Get full text
Get full text
Article -
16
Application of a simple mono window land surface temperature algorithm from landsat ETM+ over al Qassim, Saudi Arabia
Published 2012“…The proposed technique employed a mono window LST algorithm for retrieving surface temperature from Landsat ETM+. …”
Get full text
Get full text
Get full text
Article -
17
-
18
Biometrics electronic purse
Published 1999“…This paper looked into using biometrics as a mean of authentication, thus requiring a new generation of Smart Card technology to be implemented in banking and multiple applications environment. …”
Get full text
Get full text
Get full text
Proceeding Paper -
19
Line clipping based on parallelism approach and midpoint intersection
Published 2014Get full text
Get full text
Get full text
Conference or Workshop Item -
20
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
Published 2010“…We also have a driver rest period.The problem is solved heuristically.A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows. A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
Get full text
Get full text
Get full text
Article
