Scheduling real-time computations with separation constraints (Q1198025): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
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 |
Latest revision as of 14: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
16 January 1993
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