Efficient heuristic algorithms for path-based hardware/software partitioning (Q988463): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Low-complex dynamic programming algorithm for hardware/software partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338964 / rank
 
Normal rank

Revision as of 02:41, 3 July 2024

scientific article
Language Label Description Also known as
English
Efficient heuristic algorithms for path-based hardware/software partitioning
scientific article

    Statements

    Efficient heuristic algorithms for path-based hardware/software partitioning (English)
    0 references
    0 references
    0 references
    26 August 2010
    0 references
    algorithm
    0 references
    heuristic
    0 references
    tabu search
    0 references
    dynamic programming
    0 references
    hardware/Software partitioning
    0 references

    Identifiers

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