Search Results - (( based computer window algorithm ) OR ( java application customization algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

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

    Published 2024
    “…Current research on tackling uncertainty revolves around creating specifically tailored algorithms that can operate in the presence of value uncertainty using both a count-based and a time-based approach. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    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.

    Published 2024
    “…Lately, a fully online buffer-based clustering algorithm for handling evolving data streams (BOCEDS) was developed. …”
    Article
  8. 8
  9. 9

    Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

    Published 2014
    “…Detection is provided by using statistical analysis in each window, then the appropriate replacement for the noisy pixel is conducted from given values inside the current window or adjacent reconstructed pixels based on mean calculation and also, for very high density of noise which density of noise is bigger than 80%, the reconstruction is based on a recursive approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10
  11. 11

    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.

    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
  12. 12
  13. 13
  14. 14

    Development Of Stereo-Matching Algorithm Based On Adaptive Weighted Prediction by Abd Razak, Siti Safwana

    Published 2019
    “…Comparison of this framework continue in some of the state-of-the-arts algorithm in the literature and the results is outperformed based on the proposed algorithm experimental result.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

    Published 2015
    “…On the other hand, agent-based model offers a good method to solve complex computational problems. …”
    Get full text
    Get full text
    Thesis
  16. 16

    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

    Published 2012
    “…The land surface emissivity and solar angle values were needed in order to apply these in the proposed algorithm. The surface emissivity values were computed based on the NDVI values. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

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

    Published 2017
    “…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
    Article
  18. 18

    Framework for stream clustering of trajectories based on temporal micro clustering technique by Abdulrazzaq, Musaab Riyadh

    Published 2018
    “…In the online phase, the stream clustering algorithm for trajectories based on the lifespan of the cluster is proposed (CC_TRS) to overcome the limitations of the time window technique. …”
    Get full text
    Get full text
    Thesis
  19. 19

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

    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
  20. 20