Minimizing Maximum Weighted Error for Imprecise Computation Tasks
From MaRDI portal
Publication:4290916
DOI10.1006/JAGM.1994.1020zbMATH Open0804.68015OpenAlexW2014808299MaRDI QIDQ4290916FDOQ4290916
Authors:
Publication date: 5 May 1994
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1020
Recommendations
- Scheduling imprecise computation tasks on uniform processors
- Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- On-Line Scheduling of Imprecise Computations to Minimize Error
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (10)
- Title not available (Why is that?)
- Open shop scheduling problems with late work criteria.
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Scheduling imprecise computation tasks on uniform processors
- IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
- Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- The two-machine flow-shop problem with weighted late work criterion and common due date
This page was built for publication: Minimizing Maximum Weighted Error for Imprecise Computation Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290916)
