Search Results - (( using computer window algorithm ) OR ( java application learning algorithm ))
Search alternatives:
- application learning »
- learning algorithm »
- window algorithm »
- java application »
-
1
Date store management in sliding window based on-line identification algorithms
Published 2001Get full text
Get full text
Conference or Workshop Item -
2
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 -
3
-
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
-
11
Window based personalized time management system
Published 2012Get full text
Get full text
Undergraduates Project Papers -
12
-
13
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 -
14
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 -
15
-
16
Line clipping based on parallelism approach and midpoint intersection
Published 2014Get full text
Get full text
Get full text
Conference or Workshop Item -
17
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 -
18
Metaheuristics for the waste collection vehicle routing problem with time windows
Published 2010“…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
Get full text
Get full text
Conference or Workshop Item -
19
Development of optimum window size in tropical climate using computational fluid dynamics and experimental works
Published 2016“…The k-ε for turbulent flow and finite volume method (FVM) with SIMPLE algorithm for treatment of boundary layers was used. …”
Get full text
Get full text
Thesis -
20