Complexity results for weighted timed event graphs (Q429654): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2010.03.006 / rank
Normal rank
 
Property / author
 
Property / author: Alix Munier Kordon / rank
Normal rank
 
Property / author
 
Property / author: Alix Munier Kordon / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPIN / rank
 
Normal rank
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/j.disopt.2010.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066896771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the cyclic scheduling problem on parallel processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling cycle shops: Classification, complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Firing rate optimization of cyclic timed event graphs by token allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimisation of invariant criteria for event graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marking optimization of weighted marked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing place capacities of weighted event graphs for enforcing liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for the liveness of weighted event graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on n-Coloring the Points of a Linear Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2010.03.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:18, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity results for weighted timed event graphs
scientific article

    Statements

    Complexity results for weighted timed event graphs (English)
    0 references
    0 references
    0 references
    20 June 2012
    0 references
    weighted timed event graphs
    0 references
    throughput
    0 references
    buffer requirement
    0 references
    complexity
    0 references
    approximation algorithm
    0 references

    Identifiers