Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Off-Line Algorithms"”.

  1. Scheduling periodic-time-critical tasks on multiprocessor computing systems /

    … periodically, each of which has a prescribed deadline. The allocation problem is to use a minimum number of processors subject to the condition that the tasks allocated to any processor must be feasibly schedulable according to some specified algorithm, i.e. the schedule provided by the algorithm …

    oklahoma-thes Repository record for Scheduling periodic-time-critical tasks on multiprocessor computing systems / (opens in a new tab)

  2. Asymptotic Worst-Case Analyses for the Open Bin Packing Problem

    … the OBPP is NP-hard and propose two heuristic algorithms instead of solving the problem to optimality. We propose two offline algorithms in which the information of the items is known in advance. First, we consider the First Fit Decreasing (FFD) which is a good approximation algorithm for the …

    vt Repository record for Asymptotic Worst-Case Analyses for the Open Bin Packing Problem (opens in a new tab)