Scheduling real-time computations with separation constraints (Q1198025): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90091-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000197176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Variants of the Bandwidth Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:35, 16 May 2024

scientific article
Language Label Description Also known as
English
Scheduling real-time computations with separation constraints
scientific article

    Statements

    Scheduling real-time computations with separation constraints (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    real-time systems
    0 references
    separation problem
    0 references
    polynomial time algorithm
    0 references
    directed forest
    0 references
    trees
    0 references
    forest
    0 references
    minimum distance constraints
    0 references
    0 references