Search alternatives:
path scheduling » task scheduling (Expand Search)
wt algorithm » rd algorithm (Expand Search), _ algorithms (Expand Search)
elements wt » elements _ (Expand Search)
Showing 1 - 10 results of 10 for search '(( elements wt algorithm ) OR ((( element mapping algorithm ) OR ( path scheduling algorithm ))))', query time: 0.13s Refine Results
  1. 1
  2. 2

    Activity-level space scheduling by Zouein, Pierrette P.

    Published 1992
    “…An interactive and graphical decision-support tool, named MovePlan, is presented to assist in space scheduling. Its output layouts can be used to refine individual robot's trajectories using traditional path-planning algorithms.…”
    Get full text
    Get full text
    Get full text
    conferenceObject
  3. 3

    Loop based scheduling for high level synthesis by Al-Sukhni, H.F.

    Published 1995
    “…This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. …”
    Get full text
    Get full text
    article
  4. 4

    Deep Reinforcement Learning for Resource Constrained HLS Scheduling by Makhoul, Rim

    Published 2022
    “…The two main steps in HLS are: operations scheduling and data-path allocation. In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  5. 5
  6. 6
  7. 7

    Nonlinear analysis of shell structures using image processing and machine learning by M.S. Nashed (16392961)

    Published 2023
    “…The proposed approach can be significantly more efficient than training a machine learning algorithm using the raw numerical data. To evaluate the proposed method, two different structures are assessed where the training data is created using nonlinear finite element analysis. …”
  8. 8
  9. 9

    Evacuation of a highly congested urban city by El Khoury, John

    Published 2017
    “…The algorithm uses Dijkstras algorithm to find the shortest path(s) and a modified greedy algorithm to assign maximum flows to selected paths given a specific schedule per time interval. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  10. 10