A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs (Q1909003): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank

Latest revision as of 11:05, 24 May 2024

scientific article
Language Label Description Also known as
English
A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
scientific article

    Statements

    A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 1996
    0 references
    0 references
    real time-video signal processing
    0 references
    local search
    0 references
    mapping problem
    0 references
    delay management
    0 references
    partitioning
    0 references
    scheduling
    0 references
    recursive bipartitioning
    0 references