Search Results - (( _ computer window algorithm ) OR ( java implication based algorithm ))

Date store management in sliding window based on-line identification algorithms by Asirvadam , Vijanth Sagayan, McLoone, Sean, Irwin, George W

Get full text
Get full text

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

“…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

An enhancement of sliding window algorithm for rainfall forecasting by Azahar, Siti Nor Fathihah, Othman, Mahmod, Saian, Rizauddin

Get full text
Get full text
Get full text

Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

Get full text
Get full text
Get full text
Get full text

Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model by Raja Wahab, Raja Azhan Syah

“…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

Metaheuristics with disposal facility positioning for the waste collection VRP with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

“…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

Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

“…The results also show low memory usage and computing power in comparison with the baseline algorithms. � 2023 THE AUTHORS…”

Improving the efficiency of clustering algorithm for duplicates detection by Emran, Nurul Akmar, Abdul Rahim, Abdulrazzak Ali Mohamed, Kamal Baharin, Safiza Suhana, Othman, Zahriah, Salem, Awsan Thabet, Abd Aziz, Maslita, Md. Bohari, Nor Mas Aina, Abdullah, Noraswaliza

Get full text
Get full text
Get full text
Get full text

Window based personalized time management system by Siew Ann, Lilian Tong

Get full text
Get full text

Windows-Based bandwidth allocation on optical networks by Mahadevan, V., Yu, W., Zhou, J.

Get full text
Get full text

Intelligent signature detection for scanning Internet Worms by Rasheed M.M., Ghazali O., Norwawi N.M.

Subjects:

Comparison of malware detection model using supervised machine learning algorithms / Syamir Mohd Shahirudin by Mohd Shahirudin, Syamir

Get full text
Get full text

Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

Get full text
Get full text

Application of a simple mono window land surface temperature algorithm from landsat ETM+ over al Qassim, Saudi Arabia by Lim, H.S, Mat Jafri, M·Z, Abdullah, K, Sultan AlSultan

“…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

Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

“…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

Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser by Chai, S. W., Kamaluddin, M. R., Ab Rashid, M. F. F.

“…To the best of authors’ knowledge, this is the first attempt to build HHO algorithm for VRPTW problem. Computational experiment indicated that the HHO came up with the best average fitness compared with other comparison algorithms in this study including Artificial Bee Colony (ABC), Particle Swarm Optimisation (PSO), Moth Flame Optimiser (MFO), and Whale Optimisation Algorithm (WOA). …”
Get full text
Get full text
Get full text

Enhanced local disparity map algorithm segment-side window-based cost aggregation and refinement by Kadmin, Ahmad Fauzan, Al-Asbahi, Monther Yousef Abdulwasea Mohammed, Hamzah, Rostam Affendi, A Aziz, Khairul Azha, Zainal, Nasharuddin, Jazlan, Nabil Jazli

Get full text
Get full text
Get full text

A biological inspired fuzzy adaptive window median filter (FAWMF) for enhancing DNA signal processing by Ahmad, M., Jung, L.T., Bhuiyan, A.-A.

“…Methods This paper introduces a biological inspired fuzzy adaptive window median filter (FAWMF) which computes the fuzzy membership strength of nucleotides in each slide of window and filters nucleotides based on median filtering with a combination of s-shaped and z-shaped filters. …”
Get full text
Get full text

Line clipping based on parallelism approach and midpoint intersection by Hattab, Adel Salem Abdullah, Yusof, Yuhanis

Get full text
Get full text
Get full text

Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

“…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