Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Minimizing the number of late tasks with error constraint
Joseph Y.T. Leung, C. S. Wong
Research output
:
Contribution to journal
›
Article
›
peer-review
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimizing the number of late tasks with error constraint'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Error Constraint
100%
Ready Time
100%
Execution Time
66%
Optimal Schedule
66%
Polynomial-time Algorithm
33%
NP-hard
33%
Single Processor
33%
Identical Processors
33%
Total Execution Time
33%
Preemptive Scheduling
33%
Total Error
33%
Imprecise Computation Model
33%
Worst-case Performance
33%
Fast Heuristic
33%
Pseudo-polynomial Time Algorithm
33%
Computer Science
Execution Time
100%
Polynomial Time Algorithm
50%
polynomial-time algorithm
50%
Single Processor
50%
Total Execution Time
50%
Mathematics
Execution Time
100%
Polynomial Time
66%
Worst Case
33%
Asymptotics
33%
Total Error
33%