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

Refine Results
  1. 1
  2. 2

    Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…Problem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for serving. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

    Published 2016
    “…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    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
  5. 5
  6. 6

    SLIDING WINDOW TRAINING ALGORITHMS USING MLP-NETWORK FOR CORRELATED AND LOST PACKET DATA by AHMED IZZELDIN, HUZAIFA TAWFEIG

    Published 2012
    “…This thesis gives a systematic investigation of various MLP learning mainly Sliding Window (SW) learning mode which is treated as the adaptation of offline algorithms into online application Consequently this thesis reviews various offline algorithms including: batch backpropagation, nonlinear conjugate gradient, limited memory and full-memory Broyden, Fletcher, Goldfarb and Shanno algorithms and different forms of the latest proposed bimary ensemble learning. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

    Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

    Published 2022
    “…The first part introduces a flexible window-overlapping scheduling (FWOS) algorithm that allows the TT windows to overlap in GCL implementations. …”
    Get full text
    Get full text
    Thesis
  14. 14

    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

    Published 2025
    “…This paper introduces a Segment-Side Window based (SSW) stereo matching algorithm that combines Truncated Absolute Difference (TAD), Gradient Magnitude (GM), and Census Transform (CT) to build a robust cost volume. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN) by Shalghum, Khaled M., Noordin, Nor Kamariah, Sali, Aduwati, Hashim, Fazirulhisyam

    Published 2021
    “…Accordingly, more relaxed scheduling algorithms are required. In this paper, we introduce the flexible window-overlapping scheduling (FWOS) algorithm that optimizes the overlapping among TT windows by three different metrics: the priority of overlapping, the position of overlapping, and the overlapping ratio (OR). …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20