Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights (Q2840155): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Spyros A. Reveliotis / rank
Normal rank
 
Property / author
 
Property / author: Spyros A. Reveliotis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087924522 / rank
 
Normal rank

Latest revision as of 19:36, 19 March 2024

scientific article
Language Label Description Also known as
English
Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights
scientific article

    Statements

    Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights (English)
    0 references
    0 references
    0 references
    17 July 2013
    0 references
    discrete event systems
    0 references
    deadlock avoidance
    0 references
    classification theory
    0 references
    set-covering problem
    0 references
    polyhedral theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references